Rita and Sam play the following game with n sticks on a table. Each must remove 1, 2, 3, 4 or 5 sticks at a time on altemate tums, and no stick that is removed is put back on the table.The one who removes the last stick(or sticks) from the table wins. If Rita goes first, which of the following is a value of n such that Sam can always win no matter how Rita plays?
7
10
11
12
16
两个人不管第一个人怎么走,第二个人都能凑成6 ,所以6的倍数即可
登录 或 注册 后可以参加讨论