【poj 2234】Matches Game
2015-08-11 10:29
344 查看
Matches Game
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 9180 Accepted: 5298
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
The input consists of several lines, and in each line there is a test case. At the beginning of a line, there is an integer M (1 <= M <=20), which is the number of piles. Then comes M positive integers, which are not larger than 10000000. These M integers represent
the number of matches in each pile.
Output
For each test case, output "Yes" in a single line, if the player who play first will win, otherwise output "No".
Sample Input
2 45 45
3 3 6 9
Sample Output
No
Yes
最简单的Nim问题
code:
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 9180 Accepted: 5298
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
The input consists of several lines, and in each line there is a test case. At the beginning of a line, there is an integer M (1 <= M <=20), which is the number of piles. Then comes M positive integers, which are not larger than 10000000. These M integers represent
the number of matches in each pile.
Output
For each test case, output "Yes" in a single line, if the player who play first will win, otherwise output "No".
Sample Input
2 45 45
3 3 6 9
Sample Output
No
Yes
最简单的Nim问题
code:
#include <iostream> #include <cstdio> #include <algorithm> #include <cstring> using namespace std; int main() { int t,n; while(scanf("%d",&n)!=EOF) { int sum=0; for(int i=0;i<n;i++) { scanf("%d",&t); sum^=t; } if(sum==0) printf("No\n"); else printf("Yes\n"); } return 0; }
相关文章推荐
- React 创建自定义控件
- 域名与IP对应,解决只能IP访问不能域名访问的问题
- 集成电路中的assert和deassert应该如何翻译?
- N!
- document.body.scrollTop等常见易混淆属性整理
- java学习笔记-------对卡片布局管理器的深入理解
- bfs模板
- How to get file name when user select a file via <input type=“file” />?
- Tomcat类加载器机制(Tomcat源码解析六)
- ZOJ 3541 - The Last Puzzle(区间dp)
- 20-01-其他对象API(System类)
- [IOS]mac以太网连接
- Codeforces Round #315 (Div. 2)569B Inventory(队列)
- 禁掉a链接的几种方法
- Nginx启动错误:error while loading shared libraries: libpcre.so.1
- hdu-1233 还是畅通工程
- HDU 1082 Matrix Chain Multiplication
- ObjectARX获取实体个数
- 天声人語 20150811
- PullScrollView进阶(一)----->图片下拉回弹