[博弈]HDU 2509 Be the Winner
来源:互联网 发布:python 技术指标 编辑:程序博客网 时间:2024/04/30 09:04
传送门:Be the Winner
Be the Winner
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1679 Accepted Submission(s): 902
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
解题报告:
Nim博弈,注意全是1的时候,特判。代码如下:
#include <stdio.h>int main(){ int t,sum,tmp,flag; while(scanf("%d",&t)==1){ sum=flag=0; for(int i=0;i<t;i++){ scanf("%d",&tmp); sum^=tmp; if(tmp!=1) flag=1; } if(flag){ if(!sum) printf("No\n"); else printf("Yes\n"); } else{ if(sum%2==0) printf("Yes\n"); else printf("No\n"); } } return 0;}
0 0
- HDU 2509 Be The Winner ( 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)
- 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 博弈)
- HDU 2509 Be the Winner 尼姆博弈
- HDU 2509 Be the Winner(尼姆博弈)
- Be the Winner HDU杭电2509 【尼姆博弈】
- HDU-2509-Be the Winner,博弈题~~水过~~
- HDU 2509 Be the Winner (尼姆博弈)
- Be the Winner HDU-2509【Nim经典博弈】
- Be the Winner+hdu+尼姆博弈
- apache虚拟主机
- OGNL表达式和EL表达式
- ortp库API说明
- MyEclipse去掉debug模式
- Unity学习(二):一些游戏开发中的术语(未完待续)
- [博弈]HDU 2509 Be the Winner
- C++调用gSoap编写的WEBSERVICE与C#.NET间接口自定义结构体不能重复使用
- 从Jetty、Tomcat和Mina中提炼NIO构架网络服务器的经典模式
- poj 1655 树形DP
- CentOS虚拟机如何设置共享文件夹,并在Windows下映射网络驱动器?
- 观《那人那山那狗》有感
- JSON 解析相关 知识
- 数字图像处理—频域变换简单说明
- Dalvik字节码类型描述符