BZOJ 1603 USACO 2008 Oct. 打谷机

#include<cstdio>
#include<algorithm>
using namespace std;
int n,ans;
bool a[1010][1010];
inline int read(){
	int f=1,k=0; char c=getchar();
	while(c<‘0‘||c>‘9‘)c==‘-‘&&(f=-1),c=getchar();
	while(‘0‘<=c&&c<=‘9‘)k=k*10+c-‘0‘,c=getchar();
	return k*f;
}
int main(){
	n=read();
	for(int i=1;i<n;i++){
		int x=read(),y=read();
		a[x][y]=read();
	}
	for(int i=2;i<=n;i++){
		ans+=a[i-1][i];
	}
	return printf("%d\n",ans%2),0;
}