Cod sursa(job #128597)
Utilizator | Puni Andrei Paul crawler | Data | 27 ianuarie 2008 14:47:43 |
---|---|---|---|
Problema | Xerox | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <cstdio>
void solve()
{
int n,m,XOR,a,b;
XOR = 0;
scanf("%d%d%d%\n", &n, &a,&b);
for (int i=1;i<=n;++i)
{
scanf("%d", &m);
XOR ^= m;
for (int j=1;j<=m;++j)
scanf("%d%d", &a,&b);
}
if (XOR) printf("1\n"); else printf("0\n");
}
int main()
{
freopen("xerox.in","r",stdin);
freopen("xerox.out","w",stdout);
int t;
scanf("%d\n", &t);
while (t--) solve();
return 0;
}