hdoj Be the Winner 2509 (NIM博弈)
来源:互联网 发布:mac怎么打开exe文件 编辑:程序博客网 时间:2024/06/04 17:59
Be the Winner
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2713 Accepted Submission(s): 1484
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#include<stdio.h>#include<math.h>int main(){int n,i;int a[110];int sum;while(scanf("%d",&n)!=EOF){sum=0;bool flag=false;for(i=1;i<=n;i++){scanf("%d",&a[i]);sum^=a[i];if(a[i]!=1)flag=true;}if(!flag){if(n&1)printf("No\n");elseprintf("Yes\n");}else{if(sum==0)printf("No\n");elseprintf("Yes\n");}}return 0;}
0 0
- hdoj Be the Winner 2509 (NIM博弈)
- 20140715 「博弈 - Nim(尼姆)博弈」 HDOJ 2509 Be the Winner
- 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)
- HDU 2509 Be the Winner Nim博弈
- hdoj 2509 Be the Winner 【博弈】
- hdoj--2509--Be the Winner(尼姆博弈)
- HDOJ 2509 Be the Winner (反尼姆博弈)
- HDU(2509) Be the Winner /HDU(1907) John (Nim 博弈)
- Be the Winner HDU-2509【Nim经典博弈】
- HDU2509 Be the Winner Nim博弈
- HDOJ 题目1509 Be the Winner(anti-nim)
- HDU 2509 Be the Winner && HDU 1907 John (Nim博弈变形)
- hdu 2509 Be the Winner(博弈)
- HDU 2509 Be the Winner(Anti-Nim)
- Minimum Path Sum
- myeclipse 下创建包提示The folder is already a source folder
- java poi 上传与下载word文件
- Android 通过WebService调用天气预报接口
- EA使用教程
- hdoj Be the Winner 2509 (NIM博弈)
- 如何在HTML中嵌入JavaScript
- linux开发常用命令整理
- 【codevs2488】 绿豆蛙的归宿 DP+拓扑排序
- c/c++笔试题1
- 拓扑排序
- AI CDR文字路径
- rabbitMQ学习笔记(2):最简单的helloworld
- Google《Android性能优化》第1季