ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1023. Buttons

Who can explain me the problem?
Posted by Simeon Kostenski 17 Apr 2001 03:13
Hi All. I just can't understand when the problem has no
solution. For example, if we choose n-1, then the first
player can choose either 1 or n-1 (these are the limits).
If he chooses 1 then you take n-1 and win, if n-1-> 1 and
win again. I just can't understand. If possible, please
help. 10x in advance
Re: Who can explain me the problem?->I can
Posted by Nazar Revutsky 17 Apr 2001 04:18
For N=6 winning L=2 (L=5 is also winning but 2<5)

2+1+2+1
2+1+1+2
1+2+2+1
1+2+1+2

You must find minimal L for win.
The answer 0 is possible if k=1!
Posted by shitty.Mishka 14 Oct 2001 03:58
Re: The answer 0 is possible if k=1?(+)
Posted by Junjie Liang 31 Jan 2002 20:34
Wait a minute, isn't k >= 3?