Why is this code getting RTE? https://ideone.com/fork/KqmvTw The problem statememt: https://cses.fi/problemset/task/1092 Thanks in advance.
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Why is this code getting RTE? https://ideone.com/fork/KqmvTw The problem statememt: https://cses.fi/problemset/task/1092 Thanks in advance.
Name |
---|
I think k — sum1 < 0 for some cases .
Simply do this .
n = 4
1 2 3 4
set1 : 1 4
set2 : 2 3
n = 6
1 2 3 4 5 6
The ans will be no because odd number of pairs .
n = 8
1 2 3 4 5 6 7 8
set1 : 1 8 3 6
set2 : 2 7 4 5
Property of arithmetic progression .
Try taking n as long long. Your code is having integer overflow when you take n >= 1e5
Thanks both so much