poj1740 A New Stone Game(博弈)
来源:互联网 发布:未来软件官网 编辑:程序博客网 时间:2024/05/17 06:38
A New Stone Game
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 5028 Accepted: 2753
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
32 1 321 10
Sample Output
10
Source
LouTiancheng@POJ
此博客一语道破天机
http://www.cnblogs.com/rainydays/archive/2011/07/09/2101918.html
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#include<queue>#include<stack>#include<vector>#include<set>#include<map>#define L(x) (x<<1)#define R(x) (x<<1|1)#define MID(x,y) ((x+y)>>1)#define eps 1e-8typedef __int64 ll;using namespace std;#define N 15int a[N];int main(){int i,j,n;while(scanf("%d",&n),n){for(i=0;i<n;i++)scanf("%d",&a[i]);if(i&1){printf("1\n");continue;}sort(a,a+n);for(i=0;i<n;i+=2)if(a[i]!=a[i+1]){printf("1\n");break;}if(i>=n)printf("0\n");}return 0;}
1 0
- poj1740 A New Stone Game(博弈)
- [POJ1740]A New Stone Game(博弈)
- POJ1740 A New Stone Game 博弈
- poj1740 A New Stone Game 博弈
- 【POJ1740】A New Stone Game 构造博弈
- poj1740 A New Stone Game
- POJ1740 A New Stone Game
- 【poj1740】 A New Stone Game
- [poj1740]A New Stone Game
- POJ1740--A New Stone Game(Nin变形)
- A New Stone Game(博弈)
- poj1740(A New Stone Game+男人八题之一)
- pku 1740 A New Stone Game(博弈,感性)
- POJ 1740 A New Stone Game (博弈)
- poj 1740 A New Stone Game(博弈)
- POJ 题目1740 A New Stone Game(博弈)
- poj 1740 A New Stone Game( 博弈)
- poj 1740 A New Stone Game(博弈)
- 调用DLL窗体 cannot assign a TFont to a TFont 问题
- FastMM4
- XE笔记
- openstack中swift和cinder中的区别
- ubuntu下eclipse不识别手机解决方案
- poj1740 A New Stone Game(博弈)
- web开发N例-案例1:PHP嵌入html并输出html元素
- 二维数组和指向指针的指针
- thrift学习
- Android中View转换为Bitmap及getDrawingCache=null的解决方法
- 几种常见哈希函数代码实现
- 导入CSV到HTML
- html基础知识梳理
- Extjs系列之一 开篇+function扩展