A New Stone Game
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 5945 | Accepted: 3256 |
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
弱鸡难以理解博弈论
1个堆必胜
2个堆一样时,肯定会搞成2个一,这时先手就赢了
但是如果两个堆不同,先手就会变成相同,至于输
奇数个堆时,先手会搞成偶数个相等的堆,后手会输
只有初始状态石子数量相等的堆都有偶数个的时候先手必败,其余先手必胜。
#include<algorithm> #include<cstdio> int n,a[15]; int main(){ while(~scanf("%d", &n) && n){ for( int i = 1; i <= n; i++ ) scanf("%d", &a[i]); if( n%2 ){ puts("1"); continue; } std::sort(a+1,a+n+1); int i; for( i = 1; i <= n; i += 2 ) if( a[i] != a[i+1] ) { puts("1"); break; } if( i > n ) puts("0"); } return 0; }