高精度威佐夫博弈

链接:http://www.51nod.com/Challenge/Problem.html#!#problemId=1185

本来威佐夫博弈只用a*(sqrt(5)+1)/2就行了，可这题精度太高，必须将0.618的精度再扩大很多倍

#include 
#include 
#include 
#include 
#include 
using namespace std;
typedef long long LL;
LL tmp[3] = {618033988,749894848,204586834};
LL MOD = 1000000000;
int main()
{
    int T;
    LL m, n;
    cin>>T;
    while(T--)
    {
        cin>>m>>n;
        if(m < n)
            swap(n, m);
        LL cha = m - n;
        LL ta = cha/MOD, tb = cha%MOD;
        LL tp = tb*tmp[2];
        tp = ta*tmp[2] + tb*tmp[1] + tp/MOD;
        tp = ta*tmp[1] + tb*tmp[0] + tp/MOD;
        tp = cha + ta*tmp[0] + tp/MOD;
        if(tp == n)
            puts("B");
        else
            puts("A");
    }
    return 0;
}