HDU2509 Be the Winner 博弈

来源:互联网 发布:淘宝的买家秀在哪看 编辑:程序博客网 时间:2024/06/07 21:07
/*和1907几乎完全一样,不解释*/#include <iostream>  using namespace std;  int value[101];  int main ()  {      int n,sum,temp, i, cnt;     while (cin>>n)      {sum = 0;cnt = 0;for(i = 0; i < n; i++){cin>>temp;sum = sum^temp;if(temp > 1)cnt = 1;}if(cnt == 0)sum = ( (n-1) % 2 );        if(sum == 0)cout<<"No"<<endl;elsecout<<"Yes"<<endl;    }      return 0;  }