威佐夫博弈有关证明
如果起始状态为奇异局势,则为先手必败;
最后有个公式,判断给出的(a,b)是否为奇异局势;
a=[k(1+√5)/2],b= a + k (k=0,1,2,…,n 方括号表示取整函数)
k=[a(√5-1)/2];如果a==[k(1+√5)/2],那么a=a,b=a+k,否则a=a+1,b=
a+k+1;满足条件就是奇异局势,否则是非奇异局势;
#include<cstdio>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
double k=(sqrt(5)-1.0)/2.0;
int n,m;
while(~scanf("%d%d",&n,&m))
{
if(n>m)
swap(n,m);
int j=n*k;
if(n!=(int)(j*(1+k)))
j++;
if(n+j==m)
printf("0\n");
else
printf("1\n");
}
}
hdu 2177
详情请看这篇博客
#include<cstdio>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int a,b;
while(~scanf("%d%d",&a,&b)&&(a||b))
{
if(a>b)
swap(a,b);
int k=b-a;
int aa=k*(1.0+sqrt(5.0))/2.0;
if(aa==a)
{
printf("0\n");
continue;
}
printf("1\n");
int bb=aa+k;
if(a-aa==b-bb&&a>aa)
printf("%d %d\n",aa,bb);
k=2.0*a/(sqrt(5.0)+1)+1;//按照状态的小值来计算k
bb=a+k;
aa=k*(1.0+sqrt(5.0))/2;
if(a==aa&&b>bb)//a不动,只取b,(a<b)
printf("%d %d\n",aa,bb);
k=2.0*a/(3+sqrt(5.0))+1;//按照状态的大值来计算k
bb=a;
aa=k*(1+sqrt(5.0))/2;
if(bb-k==aa)//a不动,只取b(a>b)
printf("%d %d\n",aa,bb);
k=2.0*b/(3+sqrt(5.0))+1;
bb=b;
aa=k*(1.0+sqrt(5.0))/2;
if(bb-k==aa&&aa<a&&a!=b)//b不动,只取a(a!=b防止和上一种情况重复)
printf("%d %d\n",aa,bb);
}
}