hdu 2509 Be the Winner(博弈Nim)
来源:互联网 发布:华硕笔记本推荐 知乎 编辑:程序博客网 时间:2024/05/16 12:21
Be the Winner
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uAppoint description:
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>int a[105];int main(){ int i,ans,n,temp; while(scanf("%d",&n)!=EOF) { temp=0;//孤单堆 for(i=0;i<n;i++) { scanf("%d",&a[i]); if(i==0) ans=a[i]; else ans=ans^a[i]; if(a[i]>1) temp=1; } if(temp==0) { if(n%2==1) printf("No\n"); else printf("Yes\n"); continue; } if(ans==0) printf("No\n"); else printf("Yes\n"); } return 0;}
0 0
- 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博弈
- HDU(2509) Be the Winner /HDU(1907) John (Nim 博弈)
- Be the Winner HDU-2509【Nim经典博弈】
- HDU 2509 Be the Winner (Anti-Nim)
- HDU 2509 Be the Winner && HDU 1907 John (Nim博弈变形)
- 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)
- hdoj Be the Winner 2509 (NIM博弈)
- HDU2509 Be the Winner Nim博弈
- hdu 1907 John,hdu 2509 Be the Winner anti-NIM
- hdojRescue (BFS)
- PHP判断指定时间段的2个方法
- yield and Generators
- timeline播放
- 线段树专题#4_蒟蒻训练历程记录_HDU1698_ 延迟标记、区间更新
- hdu 2509 Be the Winner(博弈Nim)
- Codeforces Round #364 C. They Are Everywhere分析及题解 尺取法
- RxJava之一——一次性学会使用RxJava
- Android使用ViewPager实现左右循环滑动及轮播效果
- Linux CFS调度器之pick_next_task_fair选择下一个被调度的进程--Linux进程的管理与调度(二十八)
- 杭电 hdu 1070 Milk
- 算法竞赛入门经典第6章图论和树:竞赛选讲部分与习题
- Manacher算法--求最长回文子串
- redmine如何更改更换主题 (redmine之三)