【题解】HDU-2147 kiki's game

kiki’s game(HDU-2147)

题面

Recently kiki has nothing to do. While she is bored, an idea appears in his mind, she just playes the checkerboard game.The size of the chesserboard is n*m.First of all, a coin is placed in the top right corner(1,m). Each time one people can move the coin into the left, the underneath or the left-underneath blank space.The person who can’t make a move will lose the game. kiki plays it with ZZ.The game always starts with kiki. If both play perfectly, who will win the game?

输入

Input contains multiple test cases. Each line contains two integer n, m (0<n,m<=2000). The input is terminated when n=0 and m=0.

输出

If kiki wins the game printf “Wonderful!”, else “What a pity!”.

样例输入

1
2
3
4
5 3
5 4
6 6
0 0

样例输出

1
2
3
What a pity!
Wonderful!
Wonderful!

提示

思路

如果行列都为奇数时,先手必败

代码

查看代码
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
using namespace std;

int main()
{
int n, m;
while(~scanf("%d %d", &n, &m) && n && m)
{
if((n&1) && (m&1)){
printf("What a pity!\n");
}else{
printf("Wonderful!\n");
}
}
return 0;
}
_/_/_/_/_/ EOF _/_/_/_/_/