hdu1527取石子游戏——威佐夫博奕模板

[威佐夫博奕模板——hdu1527取石子游戏](http://acm.hdu.edu.cn/showproblem.php?pid=1527)

解析：
1.https://baike.baidu.com/item/威佐夫博弈/19858256?fr=aladdin
2.http://blog.sina.com.cn/s/blog_a661ecd501017out.html

AC code

#include <iostream>
#include <string>
#include<cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
const int maxn = 1 << 17;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
using namespace std;
typedef long long LL;
int main()
{
        LL a,b;
        while(cin >> a >> b)
        {
           LL t = a+b;
           a = min(a,b);
           b = t - a;
           LL k = b - a;
           if(floor(k*(1+sqrt(5))/2) == a)
                  cout << "0" << endl;
           else cout << "1" << endl//1是先手赢
        }
        return 0;
}