1.威佐夫博弈
int main(){
int a,b;
while(scanf("%d %d",&a,&b) != EOF){
int x,y;
x=min(a,b);
y=max(a,b);
double r=(double)(sqrt(5.0)+1)/2;
int z=(int)(r*(y-x));
if(z==x){
cout<<"0"<<endl;
}else{
cout<<"1"<<endl;
}
}
return 0;
}
尼姆博奕:
int n;
while(cin>>n){
int t,x;
t=0;
for(int i=0;i<n;i++){
cin>>x;
t^=x;
}
if(t==0){
后手赢
}else{
先手赢
}
}