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 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
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