hdu 2509 Be the Winner 尼姆博奕
来源:互联网 发布:mac 打开icloud 编辑:程序博客网 时间:2024/04/27 06:15
尼姆博奕
Be the Winner
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2821 Accepted Submission(s): 1547
Problem Description
Let's consider m apples divided into n groups. Each group contains no more than 100 apples, arranged in a line. You can take any number of consecutive apples at one time.
For example "@@@" can be turned into "@@" or "@" or "@ @"(two piles). two people get apples one after another and the one who takes the last is
the loser. Fra wants to know in which situations he can win by playing strategies (that is, no matter what action the rival takes, fra will win).
For example "@@@" can be turned into "@@" or "@" or "@ @"(two piles). two people get apples one after another and the one who takes the last is
the loser. Fra wants to know in which situations he can win by playing strategies (that is, no matter what action the rival takes, fra will win).
Input
You will be given several cases. Each test case begins with a single number n (1 <= n <= 100), followed by a line with n numbers, the number of apples in each pile. There is a blank line between cases.
Output
If a winning strategies can be found, print a single line with "Yes", otherwise print "No".
Sample Input
22 213
Sample Output
NoYes
Source
ECJTU 2008 Autumn Contest
/**========================================== * This is a solution for ACM/ICPC problem * * @source:hdu 2509 Be the Winner * @type: * @author: wust_ysk * @blog: http://blog.csdn.net/yskyskyer123 * @email: 2530094312@qq.com *===========================================*/#include<cstdio>using namespace std;typedef long long ll;int n,rich;char type;bool win(){ if(type=='T'&&!rich) return true; if(type=='S'&&rich==1) return true; if(type=='S'&&rich>=2) return true;//之前这里写成了rich>=2 Wa一发。 return false;}int main(){ int x; while(~scanf("%d",&n)) { rich=0; int sum=0; for(int i=1;i<=n;i++) { scanf("%d",&x); if(x>1) rich++; sum^=x; } type=sum?'S':'T'; puts( win()?"Yes":"No"); } return 0;}
0 0
- hdu 2509 Be the Winner 尼姆博奕
- hdu 2509 Be the Winner
- HDU 2509 Be The Winner
- hdu-2509 Be the Winner
- hdu 2509 Be the Winner
- HDU 2509 Be the Winner
- HDU 2509 Be the Winner
- HDU 2509 Be the Winner
- HDU 2509 Be the Winner
- hdu 2509 Be the Winner
- hdu 2509 Be the Winner
- HDU 2509 Be The Winner ( Nim 博弈 )
- hdu 2509 Be the Winner 1907 John
- hdu 2509 Be the Winner(博弈)
- hdu 2509 - Be the Winner(简单博弈)
- [博弈]HDU 2509 Be the Winner
- HDU 2509 -Be the Winner/ZOJ3113
- hdu 2509 Be the Winner(博弈)
- HDU 5505 GT and numbers
- hdu——2019数列有序!
- 蓝桥杯 基础练习 字母图形 有瑕丝
- 三个特殊的同余式
- 莫比乌斯反演的学习(HDU1695)
- hdu 2509 Be the Winner 尼姆博奕
- Maven学习 (五) Elipse中发布一个Maven项目到Tomcat
- java 双向链表实现双端队列
- HDU1004(枚举)
- http://www.osyunwei.com/archives/4788.html
- 哈夫曼树与哈夫曼编码
- android *** Layout 13 Adapter
- Thinking in Java---从哲学家就餐问题看死锁现象
- Arduino接口-week4-Lesson1