把每一行看成一堆,然后就是一道基础的Nim博弈了
#include <cstdio>
int main()
{
int T;
scanf("%d", &T);
for(int ca = 1; ca <= T; ca++)
{
int n, m;
scanf("%d%d", &n, &m);
int sg = 0;
for(int i = 0; i < n; i++)
{
int t, sum = 0;
for(int j = 0; j < m; j++)
{
scanf("%d", &t);
sum += t;
}
sg ^= sum;
}
printf("Case %d: %s\n", ca, sg != 0 ? "Alice" : "Bob");
}
return 0;
}