hdu 2509 sg博弈

http://acm.hdu.edu.cn/showproblem.php?pid=2509

题意：从n堆苹果中任意一堆中 取出任意多个连续的个数.最后取光者为输。Fra先下，问是否可以获胜。

和上面那题是一样的。具体详细解法看前面那篇文章。

// I'm lanjiangzhou
//C
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <math.h>
#include <time.h>
//C++
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <cctype>
#include <stack>
#include <string>
#include <list>
#include <queue>
#include <map>
#include <vector>
#include <deque>
#include <set>
using namespace std;

//*************************OUTPUT*************************
#ifdef WIN32
#define INT64 "%I64d"
#define UINT64 "%I64u"
#else
#define INT64 "%lld"
#define UINT64 "%llu"
#endif

//**************************CONSTANT***********************
#define INF 0x3f3f3f3f

// aply for the memory of the stack
//#pragma comment (linker, "/STACK:1024000000,1024000000")
//end


const int maxn  = 110;
int a[maxn];
int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        int t=0;
        int flag=0;
        memset(a,0,sizeof(a));
        for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
            t=t^a[i];
            if(a[i]>1){
                flag++;
            }
        }
        if(t==0){
            if(flag) printf("No\n");
            else printf("Yes\n");
        }
        else if(t){
            if(flag) printf("Yes\n");
            else printf("No\n");
        }

    }
    return 0;
}