Electr0's blog

How to solve this problem?
By Electr0, history, 5 years ago, In English

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?

  • Vote: I like it
  • -19
  • Vote: I do not like it

Comments Comments (5)
| Write comment?
»
5 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

you can see the editorial section on the right side of the page .

→ Reply
»
5 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Why is this post getting downvoted? I am just asking how to prove something. How is this not relevant to this community?

→ Reply