HDOJ 题目1509 Be the Winner(anti-nim)
来源:互联网 发布:linux装进u盘 编辑:程序博客网 时间:2024/06/05 16:26
Be the Winner
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2221 Accepted Submission(s): 1207
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
Recommend
lcy | We have carefully selected several similar problems for you: 1907 2510 2515 2517 2514
ac代码
#include<stdio.h>#include<string.h>int main(){int n;while(scanf("%d",&n)!=EOF){int ans=0,cot=0;while(n--){int num;scanf("%d",&num);ans^=num;if(num>1)cot++;}if((!ans&&!cot)||(ans&&cot))printf("Yes\n");elseprintf("No\n");}}
0 0
- HDOJ 题目1509 Be the Winner(anti-nim)
- HDU 2509 Be the Winner(Anti-Nim)
- HDU 2509 Be the Winner (Anti-Nim)
- hdoj Be the Winner 2509 (NIM博弈)
- hdu 1907 John,hdu 2509 Be the Winner anti-NIM
- 20140715 「博弈 - Nim(尼姆)博弈」 HDOJ 2509 Be the Winner
- HDU2509:Be the Winner(Nim)
- HDU 2509 Be the Winner Anti-SG
- HDU 2509 Be The Winner ( Nim 博弈 )
- hdu 2509 Be the Winner(博弈Nim)
- HDU 2509 Be the Winner nim博弈
- HDU 2509 Be the Winner (Nim博弈)
- hdu 2509 Be the Winner(博弈Nim)
- HDU2509 Be the Winner Nim博弈
- HDU 2509 Be the Winner Nim博弈
- hdoj--2509--Be the Winner(尼姆博弈)
- HDOJ 2509 Be the Winner (反尼姆博弈)
- [HDU2509]Be the Winner(博弈Anti-SG+Multi-SG游戏)
- 导航栏常用代码
- 数据库设计
- retainCount不能返回对象真实的被引用的次数
- 查看mysql编码
- iOS 手势并存
- HDOJ 题目1509 Be the Winner(anti-nim)
- iOS开发---网址收藏
- HTML前端ajax请求
- Xcode的Architectures、Valid Architectures和Build Active Architecture Only属性
- Single Round Match 517 Round 1 - Division I, Level Two AdjacentSwaps
- iOS 类别和继承的区别之synthesize not allowed in a category\'s implementation
- iOS UDID(转)
- Android 实现个性的ViewPager切换动画 实战PageTransformer(兼容Android3.0以下)
- 支付宝SDK和ZBar SDK冲突问题