HDU 1850 Being a Good Boy in Spring Festival
来源:互联网 发布:淘宝素材图 编辑:程序博客网 时间:2024/06/01 17:43
http://acm.hdu.edu.cn/showproblem.php?pid=1850
Problem Description
一年在外 父母时刻牵挂
春节回家 你能做几天好孩子吗
寒假里尝试做做下面的事情吧
陪妈妈逛一次菜场
悄悄给爸爸买个小礼物
主动地 强烈地 要求洗一次碗
某一天早起 给爸妈用心地做回早餐
如果愿意 你还可以和爸妈说
咱们玩个小游戏吧 ACM课上学的呢~
下面是一个二人小游戏:桌子上有M堆扑克牌;每堆牌的数量分别为Ni(i=1…M);两人轮流进行;每走一步可以任意选择一堆并取走其中的任意张牌;桌子上的扑克全部取光,则游戏结束;最后一次取牌的人为胜者。
现在我们不想研究到底先手为胜还是为负,我只想问大家:
——“先手的人如果想赢,第一步有几种选择呢?”
Input
输入数据包含多个测试用例,每个测试用例占2行,首先一行包含一个整数M(1<M<=100),表示扑克牌的堆数,紧接着一行包含M个整数Ni(1<=Ni<=1000000,i=1…M),分别表示M堆扑克的数量。M为0则表示输入数据的结束。
Output
如果先手的人能赢,请输出他第一步可行的方案数,否则请输出0,每个实例的输出占一行。
Sample Input
3
5 7 9
0
Sample Output
1
尼姆博奕的简单题,只要计算所有数的异或结果就行了
#include <iostream>#include <cstdio>#include <string.h>#define N 200907using namespace std;int a[110];int main(){#ifndef ONLINE_JUDGE freopen("1.txt", "r", stdin);#endif int m, i, ans; while(~scanf("%d", &m), m) { ans = 0; for (i = 0; i < m; i++) { scanf("%d", &a[i]); ans ^= a[i]; } if (ans) { int t = ans, count = 0; while(t) { count++; t >>= 1; } t = 1 << (count-1); for (count = 0,i = 0; i < m; i++) { if (t & a[i]) { count++; } } cout << count << endl; } else { cout << "0\n"; } } return 0;}#include <iostream>#include <cstdio>#include <string.h>#define N 200907using namespace std;int a[110];int main(){#ifndef ONLINE_JUDGE freopen("1.txt", "r", stdin);#endif int m, i, ans; while(~scanf("%d", &m), m) { ans = 0; for (i = 0; i < m; i++) { scanf("%d", &a[i]); ans ^= a[i]; } if (ans) { int t = ans, count = 0; while(t) { count++; t >>= 1; } t = 1 << (count-1); for (count = 0,i = 0; i < m; i++) { if (t & a[i]) { count++; } } cout << count << endl; } else { cout << "0\n"; } } return 0;}
0 0
- hdu 1850 Being a Good Boy in Spring Festival (博弈)
- hdu 1850 Being a Good Boy in Spring Festival
- hdu 1850 Being a Good Boy in Spring Festival
- HDU 1850 Being a Good Boy in Spring Festival(尼姆博奕)
- HDU 1850 - Being a Good Boy in Spring Festival
- hdu 1850 Being a Good Boy in Spring Festival
- hdu 1850 Being a Good Boy in Spring Festival
- HDU 1850 Being a Good Boy in Spring Festival
- HDU 1850 - Being a Good Boy in Spring Festival
- Hdu 1850 Being a Good Boy in Spring Festival
- HDU 1850 Being a Good Boy in Spring Festival
- [博弈]HDU 1850 Being a Good Boy in Spring Festival
- hdu 1850 Being a Good Boy in Spring Festival
- hdu 1850 Being a Good Boy in Spring Festival
- HDU(1850) Being a Good Boy in Spring Festival (博弈)
- HDU 1850 Being a Good Boy in Spring Festival
- hdu 1850 Being a Good Boy in Spring Festival
- hdu-1850 Being a Good Boy in Spring Festival
- 队列
- windows编程之剪切板
- SVN chechout 错误: xxx is not valid as filename in directory
- 基于网页可信特征的信息可信度评估方法(IEEE2011)
- RuntimeException
- HDU 1850 Being a Good Boy in Spring Festival
- Random Teams(Codeforces Round 273)
- 自己看的
- 无题 (最小生成树+prim)
- java第一课 helloword
- HDU 1031.Design T-Shirt【结构体二次排序】【8月21】
- 八大排序算法
- C和C++混合编译
- 静态变量能否被外部访问?