Problem D

Правка en1, от ayush29azad, 2021-12-08 07:04:31

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. Язык Кто Когда Δ Комментарий
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)