Be the Winner(SJ定理）

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

// File Name: hdu2509.cpp// Author: bo_jwolf// Created Time: 2013年10月04日 星期五 13:45:37#include<vector>#include<list>#include<map>#include<set>#include<deque>#include<stack>#include<bitset>#include<algorithm>#include<functional>#include<numeric>#include<utility>#include<sstream>#include<iostream>#include<iomanip>#include<cstdio>#include<cmath>#include<cstdlib>#include<cstring>#include<ctime>using namespace std;int main(){int n, ans, temp, sum;while( scanf( "%d", &n ) != EOF && n ){ans = sum = 0;while( n-- ){scanf( "%d", &temp );if( temp > 1 )sum++;ans ^= temp;}if( ans == 0 ){if( sum )printf( "No\n" );elseprintf( "Yes\n" );}else{if( sum )printf( "Yes\n" );elseprintf( "No\n" );}}return 0;}