A New Stone Game
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 6152 | Accepted: 3356 |
Description
Alice and Bob decide to play a new stone game.At the beginning of the game they pick n(1<=n<=10) piles of stones in a line. Alice and Bob move the stones in turn.
At each step of the game,the player choose a pile,remove at least one stones,then freely move stones from this pile to any other pile that still has stones.
For example:n=4 and the piles have (3,1,4,2) stones.If the player chose the first pile and remove one.Then it can reach the follow states.
2 1 4 2
1 2 4 2(move one stone to Pile 2)
1 1 5 2(move one stone to Pile 3)
1 1 4 3(move one stone to Pile 4)
0 2 5 2(move one stone to Pile 2 and another one to Pile 3)
0 2 4 3(move one stone to Pile 2 and another one to Pile 4)
0 1 5 3(move one stone to Pile 3 and another one to Pile 4)
0 3 4 2(move two stones to Pile 2)
0 1 6 2(move two stones to Pile 3)
0 1 4 4(move two stones to Pile 4)
Alice always moves first. Suppose that both Alice and Bob do their best in the game.
You are to write a program to determine who will finally win the game.
At each step of the game,the player choose a pile,remove at least one stones,then freely move stones from this pile to any other pile that still has stones.
For example:n=4 and the piles have (3,1,4,2) stones.If the player chose the first pile and remove one.Then it can reach the follow states.
2 1 4 2
1 2 4 2(move one stone to Pile 2)
1 1 5 2(move one stone to Pile 3)
1 1 4 3(move one stone to Pile 4)
0 2 5 2(move one stone to Pile 2 and another one to Pile 3)
0 2 4 3(move one stone to Pile 2 and another one to Pile 4)
0 1 5 3(move one stone to Pile 3 and another one to Pile 4)
0 3 4 2(move two stones to Pile 2)
0 1 6 2(move two stones to Pile 3)
0 1 4 4(move two stones to Pile 4)
Alice always moves first. Suppose that both Alice and Bob do their best in the game.
You are to write a program to determine who will finally win the game.
Input
The input contains several test cases. The first line of each test case contains an integer number n, denoting the number of piles. The following n integers describe the number of stones in each pile at the beginning of the game, you may assume the number of stones in each pile will not exceed 100.
The last test case is followed by one zero.
The last test case is followed by one zero.
Output
For each test case, if Alice win the game,output 1,otherwise output 0.
Sample Input
3 2 1 3 2 1 1 0
Sample Output
1 0
题意: 给你 n 堆 石子 两个人轮流拿石子 规定 拿的步骤可以分为两部 第一
选择一堆 至少拿一个 石子 第二 可以将自己的拿的那一堆的石子拿出几个挪到
其他 堆上。 当然第二步 是可以不执行的。
推荐一篇证明 很简单 粗暴。 简单的证明
代码 :
#include<stdio.h> #include<string.h> #include<iostream> #include<algorithm> #define N 105 using namespace std; int a[N]; int n; int main() { while(cin>>n) { if(n==0) break; for(int i=1;i<=n;i++) cin>>a[i]; if(n%2) { printf("1\n"); continue; } sort(a+1,a+n+1); int f=0; for(int i=1;i<=n;i+=2) { if(a[i]!=a[i+1]) { f=1; break; } } if(f) printf("1\n"); else printf("0\n"); } return 0; }