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 | 3857 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 165 |
2 | -is-this-fft- | 161 |
3 | Qingyu | 160 |
4 | Dominater069 | 158 |
5 | atcoder_official | 157 |
6 | adamant | 155 |
7 | Um_nik | 151 |
8 | djm03178 | 150 |
8 | luogu_official | 150 |
10 | awoo | 148 |
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