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 1639. Chocolate 2

???????
Posted by BlackShark 6 Mar 2009 20:03
I dont understand why the number of moves is constant.
How to prove it??
Re: ???????
Posted by HM2P33 4 Feb 2013 09:23
think in this way, each time a player makes a move, the number of chocolate pieces increases in one (first there is one piece, then two, then three and so on). But the game stop when there are n*m pieces, so there must've been n*m-1 moves.