How to solve this problem?

Правка en1, от Electr0, 2021-09-13 08:40:41

Problem link — https://mirror.codeforces.com/problemset/problem/1355/D

I was able to prove that if S>=2*n, then Petya can always win (same logic which is given in the tutorial). But I am not able to prove that if S<2*n then Petya will always lose. How to prove that?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский Electr0 2021-09-13 08:40:41 294 Initial revision (published)