hdu2509 Be the Winner 博弈
2017-03-21 00:00
197 查看
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).
博弈
View Code
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).
博弈
1 #include<stdio.h> 2 3 int main(){ 4 int n; 5 while(scanf("%d",&n)!=EOF){ 6 int i,sum=0,num=0; 7 for(i=1;i<=n;i++){ 8 int a; 9 scanf("%d",&a); 10 if(a>1)num++; 11 sum^=a; 12 } 13 if((num==0&&sum==0)||(sum>0&&num>0))printf("Yes\n"); 14 else printf("No\n"); 15 } 16 return 0; 17 }
View Code
相关文章推荐
- [HDU2509]Be the Winner(博弈Anti-SG+Multi-SG游戏)
- hdu2509 Be the Winner(博弈论---尼姆博弈)
- (step8.2.2)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(简单博弈)
- HDU(2509) Be the Winner /HDU(1907) John (Nim 博弈)
- hdu 2509 Be the Winner(博弈)
- (step8.2.2)hdu 2509(Be the Winner——简单博弈)
- 20140715 「博弈 - Nim(尼姆)博弈」 HDOJ 2509 Be the Winner
- HDU2509 Be the Winner(反NIM)
- hdoj 2509 Be the Winner 【博弈】
- HDU 2509 Be the Winner && HDU 1907 John (Nim博弈变形)
- hdu2509 Be the Winner (尼姆博弈)
- Be the Winner( HDU2509)Nim博弈
- HDU 2509 Be the Winner(取火柴博弈2)
- HDU2509 Be the Winner
- hdu 1907 John&& hdu 2509 Be the Winner(基础nim博弈)
- Be the Winner HDU-2509【Nim经典博弈】