/*
http://acm.hdu.edu.cn/showproblem.php?pid=4642
Fliping game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 191 Accepted Submission(s): 131
Problem Description
Alice and Bob are playing a kind of special game on an N*M board (N rows, M columns). At the beginning, there are N*M coins in this board with one in each grid and every coin may be upward or downward freely. Then they take turns to choose a rectangle (x1, y1)-(n, m) (1 ≤ x1≤n, 1≤y1≤m) and flips all the coins (upward to downward, downward to upward) in it (i.e. flip all positions (x, y) where x1≤x≤n, y1≤y≤m)). The only restriction is that the top-left corner (i.e. (x1, y1)) must be changing from upward to downward. The game ends when all coins are downward, and the one who cannot play in his (her) turns loses the game. Here's the problem: Who will win the game if both use the best strategy? You can assume that Alice always goes first.
Input
The first line of the date is an integer T, which is the number of the text cases.
Then T cases follow, each case starts with two integers N and M indicate the size of the board. Then goes N line, each line with M integers shows the state of each coin, 1<=N,M<=100. 0 means that this coin is downward in the initial, 1 means that this coin is upward in the initial.
Output
For each case, output the winner’s name, either Alice or Bob.
Sample Input
2
2 2
1 1
1 1
3 3
0 0 0
0 0 0
0 0 0
Sample Output
Alice
Bob
Source
2013 Multi-University Training Contest 4
Recommend
zhuyuanchen520
思路;可以看出,每次翻转都会翻动最右下角的格子。如果右下角刚开始为1,那么先手的人每次都翻动右下角的,使该格子变为0,后手的翻其他矩形,肯定会使得最右下角的格子变为1。这样先手每次都有格子翻,最后肯定是后手败。如果右下角刚开始为0,若没格子翻则后手胜,否则不管翻哪个格子,都会导致右下角变为1,后手每次都翻右下角,肯定必胜,所以是后手胜。所以结论是右下角刚开始为1则先手胜,否则后手胜。
234MS 288K 394 B
*/
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
#include<iostream>
using namespace std;
const int maxn=100+10;
int main()
{
int T,n,m,i,j,t;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%d",&t);
printf("%s\n",t==1? "Alice":"Bob");
}
return 0;
}