Can someone tell how for S>=2N, Petya wins in the following problem with also the approach?
Problem Link:https://codeforces.com/problemset/problem/1355/D I am not able to get the editorial and the approach. Please Help. !!!!
# | User | Rating |
---|---|---|
1 | tourist | 3882 |
2 | maroonrk | 3539 |
3 | Benq | 3513 |
4 | MiracleFaFa | 3466 |
5 | ksun48 | 3462 |
6 | ecnerwala | 3446 |
7 | slime | 3428 |
8 | Um_nik | 3426 |
9 | jiangly | 3401 |
10 | greenheadstrange | 3393 |
# | User | Contrib. |
---|---|---|
1 | awoo | 192 |
2 | -is-this-fft- | 191 |
3 | Monogon | 184 |
4 | YouKn0wWho | 182 |
5 | Um_nik | 181 |
6 | antontrygubO_o | 173 |
7 | maroonrk | 168 |
8 | errorgorn | 165 |
9 | kostka | 164 |
9 | SecondThread | 164 |
Problem D — Game With Array
Can someone tell how for S>=2N, Petya wins in the following problem with also the approach?
Problem Link:https://codeforces.com/problemset/problem/1355/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 |
---|