a problem about game theory

Правка en3, от a2dalek, 2020-12-05 14:32:16

I can't solve this problem: There are N stones (N<=1e18) and two players. They play alterably. At the k-th turn, player must take at least 1 stone but can take no more than k stones (player at the first turn can take no more than 1, player at the second turn can take no more than 2,..). Who takes the last stone is the winner. Give N, who will win the game, player 1 or player 2 ? Please help me. Tks.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский a2dalek 2020-12-05 14:33:21 0 (published)
en3 Английский a2dalek 2020-12-05 14:32:16 24
en2 Английский a2dalek 2020-12-05 14:30:48 100 (saved to drafts)
en1 Английский a2dalek 2020-12-05 13:33:11 327 Initial revision (published)