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 | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
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