【CUGBACM15级BC第9场 B】hdu 4994 Revenge of Nim
来源:互联网 发布:linux邮件服务器 编辑:程序博客网 时间:2024/05/21 07:46
Revenge of Nim
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 822 Accepted Submission(s): 422
Total Submission(s): 822 Accepted Submission(s): 422
Problem Description
Nim is a mathematical game of strategy in which two players take turns removing objects from distinct heaps. On each turn, a player must remove at least one object, and may remove any number of objects provided they all come from the same heap.
---Wikipedia
Today, Nim takes revenge on you. The rule of the game has changed a little: the player must remove the objects from the current head(first) heap. Only the current head heap is empty can the player start to remove from the new head heap. As usual, the player who takes the last object wins.
---Wikipedia
Today, Nim takes revenge on you. The rule of the game has changed a little: the player must remove the objects from the current head(first) heap. Only the current head heap is empty can the player start to remove from the new head heap. As usual, the player who takes the last object wins.
Input
The first line contains a single integer T, indicating the number of test cases.
Each test case begins with an integer N, indicating the number of heaps. Then N integer Ai follows, indicating the number of each heap successively, and the player must take objects in this order, from the first to the last.
[Technical Specification]
1. 1 <= T <= 100
2. 1 <= N <= 1 000
3. 1 <= Ai <= 1 000 000 000
Each test case begins with an integer N, indicating the number of heaps. Then N integer Ai follows, indicating the number of each heap successively, and the player must take objects in this order, from the first to the last.
[Technical Specification]
1. 1 <= T <= 100
2. 1 <= N <= 1 000
3. 1 <= Ai <= 1 000 000 000
Output
For each test case, output “Yes” if the first player can always win, otherwise “No”.
Sample Input
21221 1
Sample Output
YesNo
题意:
有n 堆石子,从第一堆到最后一堆,每次可以取任意多个,但只能取同一堆的,最后取完的人赢,问先手能否胜利?
思路:
尼姆博奕的变形,应该来说比尼姆博奕要好理解。 这里当某一堆里石头个数为1时,无奈,此人只能把该堆取完。
当某一堆石头个数大于1时,此时此人可以根据后面所有堆是必胜态还是必败态来决定是把该堆取完让下一个人进行那个状态还是把该堆取完只剩一个,让自己进行那个状态。 所以不管后面如何变化,我们只要考虑第一次出现的大于1的堆之前有多少个大小为1的堆即可。因为谁先进入这个第一次出现的大于1的堆即可获得胜利#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;#define N 1100int a[N];int main(){ int T, n; scanf("%d", &T); while (T--) { scanf("%d", &n); int flag = 0, ans = 0; for (int i = 1; i <= n; i++) { scanf("%d", &a[i]); if (a[i] > 1) { flag = 1; } if (!flag) { ans++; } } if (!flag) { if (ans & 1) { printf("Yes\n"); } else { printf("No\n"); } } else { if (ans & 1) { printf("No\n"); } else { printf("Yes\n"); } } } return 0;}
阅读全文
0 0
- 【CUGBACM15级BC第9场 B】hdu 4994 Revenge of Nim
- 【CUGBACM15级BC第10场 B】hdu 5019 Revenge of GCD
- 【CUGBACM15级BC第9场 A】hdu 4993 Revenge of ex-Euclid
- 【CUGBACM15级BC第16场 B】Revenge of LIS II
- 【CUGBACM15级BC第10场 A】hdu 5018 Revenge of Fibonacci
- HDU 4994 / BC 9B Revenge of Nim
- 【CUGBACM15级BC第15场 B】hdu 5082 Instruction
- 【CUGBACM15级BC第17场 B】hdu 5101 Select
- 【CUGBACM15级BC第20场 B】hdu 5124 lines
- 【CUGBACM15级BC第26场 B】hdu 5159 Card
- 【CUGBACM15级BC第28场 B】hdu 5167 Fibonacci
- 【CUGBACM15级BC第36场 B】hdu 5199 Gunner
- 【CUGBACM15级BC第16场 A】Revenge of Segment Tree
- 【CUGBACM15级BC第12场 B】hdu 5059 Help him
- 【CUGBACM15级BC第11场 B】hdu 5055 Bob and math problem
- 【CUGBACM15级BC第13场 B】hdu 5063 Operation the Sequence
- 【CUGBACM15级BC第18场 B】hdu 5105 Math Problem
- 【CUGBACM15级BC第22场 B】hdu 5143 NPY and arithmetic progression
- Arrays.asList() 需要注意
- 无限轮播+网络请求+GridView展示数据+ImageLoader-SD卡缓存+点击轮播图跳转页面
- R语言日期
- 欢迎使用CSDN-markdown编辑器
- viewpager和gridview,imageloder,解析json数组,点击不动
- 【CUGBACM15级BC第9场 B】hdu 4994 Revenge of Nim
- 点滴心得
- android广播:自定义广播(第一行代码android学习)
- SpringMVC全局异常处理器
- 就业双方合同、三方合同、用人单位类别、编制
- STM32—无需中断来实现使用DMA接收串口数据(原创)
- Kaggle实例-Titanic分析(二)-补全 拟合
- libexpat不能处理XML中非正常字符的问题
- 57个深度学习专业术语