hdu1527威佐夫博弈

参考博客

https://hrbust-acm-team.gitbooks.io/acm-book/content/game_theory/wei_zuo_fu_bo_yi.html

满足 ，后手必胜，否则先手必胜。

#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<cstdio>
#include<cassert>
#include<iomanip>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#define pi acos(-1)
#define ll long long
#define mod 1000000007
#define ls l,m,rt<<1
#define rs m+1,r,rt<<1|1
#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;

const double g=10.0,eps=1e-;
const int N=+,maxn=,inf=;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie();
    int n,m;
    while(cin>>n>>m){
        if(n>m)swap(n,m);
        int k=m-n,t=k*(+sqrt())/;
        if(n==t)cout<<<<endl;
        else cout<<<<endl;
    }
    return ;
}