题意:对k叉完全树的各个节点按的个数进行亦或。
思路:当两个子树的完全相同的时候,不需要进行亦或。当k > 1 时,树的深度为logk级别的,直接dfs不会超时。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
using namespace std;
const int maxn = 500 + 5;
#define INF 0x3f3f3f3f
#define clr(x,y) memset(x,y,sizeof x )
typedef long long ll;
#define eps 10e-8
const int Mod = 1e9 + 7;
typedef pair<int, int> P;
ll n,m;
ll a[maxn];ll b[maxn];
int len,len1;
void Init()
{
a[0] = a[1] = 1;ll t = m;
for(int i = 2; ; i ++)
{
a[i] = a[i - 1] + t ;t *= m;
if( a[i] >= n || a[i] < 0){len = i;break;}
}
t = 1;b[0] = 1;
for(int i = 1; ; i ++)
{
b[i] = b[i - 1] * m;
if(b[i] < 0 || b[i] * m >= n){len1 = i;break;}
}
}
ll dfs(ll x,ll dep)
{
if(dep == 1)
{
return 1;
}
if(dep == 2)
{
return x ^ ((x - 1) & 1 ? 1 : 0);
}
ll ret = x;
if(a[dep] == x)
{
if(m & 1)
return x ^ dfs( (a[dep] - 1)/m,dep - 1);
else return x;
}
ll t = x - 1 - m * a[dep - 2];ll t1 = (t + b[dep - 2] - 1) / b[dep - 2];ll t2 = m - t1;
if(t % b[dep - 2] == 0)
{
if(t1 & 1)
{
ret ^= dfs(a[dep - 1],dep - 1);
}
if(t2 & 1)
{
ret ^= dfs(a[dep - 2],dep - 2);
}
if(t1 & 1 == 0 && t2 & 1 == 0)ret = x;
}
else
{
if((t1 - 1) & 1 && (t1 - 1))
{
ret ^= dfs(a[dep - 1],dep - 1);
}
if(t2 & 1)
{
ret ^= dfs(a[dep - 2],dep - 2);
}
ret ^= dfs(a[dep - 2] + t % (b[dep - 2]),dep - 1);
}
return ret;
}
void solve()
{
Init();
printf("%I64d\n",dfs(n,len) );
}
int main()
{
// cout << (17 ^ 9 ^ 3) << endl;
int Tcase;scanf("%d",&Tcase);
while(Tcase --)
{
scanf("%I64d%I64d",&n,&m);
if(m == 1)
{
if(n & 1)
{
printf("%I64d\n",(n - 1)/2 & 1 ^ 1);
}
else printf("%I64d\n",(n - 2)/2 & 1 ^ 1 ^ n);
continue;
}
solve();
}
return 0;
}