poj 2234 尼姆博弈
阿新 • • 發佈：2020-07-22
|
Matches Game
Description Here is a simple game. In this game, there are several piles of matches and two players. The two player play in turn. In each turn, one can choose a pile and take away arbitrary number of matches from the pile (Of course the number of matches, which is taken away, cannot be zero and cannot be larger than the number of matches in the chosen pile). If after a player’s turn, there is no match left, the player is the winner. Suppose that the two players are all very clear. Your job is to tell whether the player who plays first can win the game or not.Input Output Sample Input 2 45 45 3 3 6 9 Sample Output No Yes |
當石子堆數為n堆時，則推廣為當對每堆的數目進行亦或之後值為零是必敗態.
#include <cstdio>
using namespace std;
int a[30];
int main(){
int n;
while(scanf("%d",&n)!=EOF){
for(int i=1;i<=n;i++)scanf("%d",&a[i]);
for(int i=2;i<=n;i++)a[1]^=a[i];
if(a[1]==0)puts("No");
else puts("Yes");
}
return 0;
}