https://cn.vjudge.net/problem/HihoCoder-1545
1、不删除根就是一般树上博弈;
2、删除根就是剩下的树的尼姆博弈;
#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
template<typename T>inline void read(T &x)
{
x=0;
static int p;p=1;
static char c;c=getchar();
while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
x*=p;
}
//-----------------------------------------------
const int maxn=1e5+9;
const int mod=1e9+7;
int ans;
vector<int>g[maxn];
int sg[maxn];
int d[maxn];
void dfs(int u,int fa)
{
for(int i=0;i<g[u].size();i++)
{
int v=g[u][i];
if(v==fa) continue;
dfs(v,u);
sg[u]^=(sg[v]+1);
}
}
int main()
{
FAST_IO;
//freopen("input.txt","r",stdin);
//freopen("powers.in","r",stdin);
int T;
cin>>T;
while(T--)
{
int n;
ans=0;
cin>>n;
for(int i=0;i<=n;i++) g[i].clear(),sg[i]=0,d[i]=0;
for(int i=1;i<=n-1;i++)
{
int u,v;
cin>>u>>v;
g[u].pb(v);
d[v]++;
}
int rt=0;
for(int i=1;i<=n;i++)
{
if(d[i]==0)
{
rt=i;
break;
}
}
dfs(rt,0);
ans=sg[rt];
if(ans) cout<<1;
else cout<<0;
ans=0;
for(int i=0;i<g[rt].size();i++) ans^=(sg[g[rt][i]]);
if(ans) cout<<1;
else cout<<0;
}
return 0;
}