51nod 1185 威佐夫游戏 V2

#include <bits/stdc++.h>
using namespace std;

long long gold[3]={618033988,749894848,204586834};
long long mod=1000000000;

int main()
{
	long long n,a,b,tmp,ta,tb,dis;
	cin>>n;
	while(n--)
	{
		scanf("%lld%lld",&a,&b);
		if(a<b)
			swap(a,b);
		dis=a-b;
		ta=dis/mod;
		tb=dis%mod;
		tmp=gold[2]*tb;
		tmp=gold[1]*tb+gold[2]*ta+tmp/mod;
		tmp=gold[0]*tb+gold[1]*ta+tmp/mod;
		tmp=gold[0]*ta+tmp/mod;
		if(tmp==b-dis)
			printf("B\n");
		else
			printf("A\n");
	}
}