hdu 5088 Revenge of Nim II(BestCoder Round #16)
来源:互联网 发布:办公考勤软件 编辑:程序博客网 时间:2024/05/19 05:04
Revenge of Nim II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 203 Accepted Submission(s): 63
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, again. As you know, the rule of Nim game is rather unfair, only the nim-sum (⊕) of the sizes of the heaps is zero will the first player lose. To ensure the fairness of the game, the second player has a chance to move some (can be zero) heaps before the game starts, but he has to move one heap entirely, i.e. not partially. Of course, he can’t move all heaps out, at least one heap should be left for playing. Will the second player have the chance to win this time?
---Wikipedia
Today, Nim takes revenge on you, again. As you know, the rule of Nim game is rather unfair, only the nim-sum (⊕) of the sizes of the heaps is zero will the first player lose. To ensure the fairness of the game, the second player has a chance to move some (can be zero) heaps before the game starts, but he has to move one heap entirely, i.e. not partially. Of course, he can’t move all heaps out, at least one heap should be left for playing. Will the second player have the chance to win this time?
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.
[Technical Specification]
1. 1 <= T <= 100
2. 1 <= N <= 1 000
3. 1 <= Ai <= 1 000 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.
[Technical Specification]
1. 1 <= T <= 100
2. 1 <= N <= 1 000
3. 1 <= Ai <= 1 000 000 000 000
Output
For each test case, output “Yes” if the second player can win by moving some (can be zero) heaps out, otherwise “No”.
Sample Input
31232 2 251 2 3 4 5
Sample Output
NoYesYesHintFor the third test case, the second player can move heaps with 4 and 5 objects out, so the nim-sum of the sizes of the left heaps is 1⊕2⊕3 = 0.
代码:
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=1110;long long a[maxn], mp[maxn][maxn];int gauss(int n){ int i, j, r, c, cnt; for (c = cnt = 0; c < n; c++) { for (r = cnt; r < 63; r++) { if (mp[r][c]) break; } if (r < 63) { if (r != cnt) { for (i = 0; i < n; i++) swap(mp[r][i], mp[cnt][i]); } for (i = cnt + 1; i < 63; i++) { if (mp[i][c]) { for (j = 0; j < n; j++) mp[i][j] ^= mp[cnt][j]; } } cnt++; } } return n - cnt;}int main(){ int c; int n, i, j; int vary; scanf("%d", &c); while (c--) { scanf("%d", &n); for (i = 0; i < n; i++) scanf("%I64d", &a[i]); for (i = 0; i < 63; i++) { for (j = 0; j < n; j++) mp[i][j] = (a[j] >> i) & 1; } vary = gauss(n); if(vary==0) printf("No\n"); else printf("Yes\n"); } return 0;}
0 0
- hdu 5088 Revenge of Nim II(BestCoder Round #16)
- hdu 5087 Revenge of LIS II(BestCoder Round #16)
- 【HDU】5088 Revenge of Nim II 高斯消元
- 【HDU】 5088 Revenge of Nim II 高斯消元
- HDU - 5088 Revenge of Nim II
- hdu 5088 Revenge of Nim II(高斯消元)
- hdu 5088 Revenge of Nim II(高斯消元)
- 【HDU 5088】Revenge of Nim II
- HDU 5088 Revenge of Nim II
- hdu 5087 Revenge of LIS II 题解(DP) BestCoder Round #16 1002
- BestCoder Round #16 1001 Revenge of Segment Tree 1002 Revenge of LIS II
- HDU-5086-Revenge of Segment Tree (BestCoder Round #16)
- hdu 5086 Revenge of Segment Tree(BestCoder Round #16)
- hdu 5086 Revenge of Segment Tree(BestCoder Round #16)
- HDU 5088 Revenge of Nim II (高斯消元??)
- hdu 5018 Revenge of Fibonacci(BestCoder Round #10)
- hdu 5019 Revenge of GCD(BestCoder Round #10)
- HDU 5088 Revenge of Nim II(尼姆博弈,高斯消元)
- 命名一个变量
- 2014秋C++第10周项目5参考-输出完数
- 平凡的变量的名称
- Google-HK-2012-interview-"pizza"(2)
- 网关是什么
- hdu 5088 Revenge of Nim II(BestCoder Round #16)
- Java实用经验总结--Swing篇
- JAVA迭代器
- 2014秋C++第10周项目6参考-贪财的富翁
- java.io.IOException: Too many open files
- 2014秋C++ 第11周项目 函数及其应用
- boost.Multi_Index库的使用
- NSNotificationCenter 用法详解
- A Great Alchemist