英文原题:题目来源:https://acs.jxnu.edu.cn/problem/ICPCJX2020J
Split Game
1000ms 131072K
描述:
Alice and Bob like to cut paper, but they only have one piece of new paper. Both of them want to use this one, but no one wants to split the new paper. Therefore, Alice and Bob decide to fight...in a game.
Alice find an old rectangular paper that consists of N*M grids. Two players take turns and Alice goes first. In each round of action, the player chooses a piece of paper and splits it horizontally or vertically along the grid line. If one player splits out a piece of paper with a single grid, he or she will lose the game. Alice and Bob are smart, and both of them want to win the game. Now you know the size of paper, please predict who will win.
输入:
Each line contains two integer numbers NN and MM, Process to end of file. (1<=N,M<=150,N∗M>1)(1<=N,M<=150,N∗M>1)
输出:
For each case, output the name of the winner.
翻译:
分裂游戏
描述:
爱丽丝和鲍勃喜欢剪纸,但他们只有一张纸。 他俩都想使用这张,但没有人想将纸分开来用。 因此,爱丽丝和鲍勃决定进行一场赌斗。
爱丽丝找到一个由N * M网格组成的旧矩形纸。 两人轮流矩进行,爱丽丝先走。 在每一轮动作中,双方选择一张纸并沿着网格线水平或垂直分裂。 如果一方用一个网格分开一张纸,就将输掉这场赌斗。 爱丽丝和鲍勃都很机智,他们都想赢。 现在你知道纸张的大小,请预测谁将获胜。
输入:
每行输入两个整数 N 和 M (1<=N,M<=150,N∗M>1)(1<=N,M<=150,N∗M>1)输入为空时停止输入
输出:
为每行输入输出赢家的名字。