Can someone tell how for S>=2N Petya wins in the following problem with also the approach? Problem Link [](http://https://mirror.codeforces.com/contest/1355/problem/D)
I am not able to get the editorial and the approach. Please Help.
# | 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 | 160 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | Dominater069 | 154 |
8 | awoo | 154 |
10 | luogu_official | 150 |
Problem D
Can someone tell how for S>=2N Petya wins in the following problem with also the approach? Problem Link [](http://https://mirror.codeforces.com/contest/1355/problem/D)
I am not able to get the editorial and the approach. Please Help.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 | ayush29azad | 2021-12-08 08:05:23 | 56 | |||
en2 | ayush29azad | 2021-12-08 07:05:21 | 61 | Tiny change: 'blem/D) \nI am not' -> 'blem/D) \n\nI am not' | ||
en1 | ayush29azad | 2021-12-08 07:04:31 | 301 | Initial revision (published) |
Name |
---|