kiki's game
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 40000/10000 K (Java/Others)
Total Submission(s): 10208 Accepted Submission(s): 6161
Problem Description
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
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.
Output
If kiki wins the game printf "Wonderful!", else "What a pity!".
Sample Input
5 3
5 4
6 6
0 0
Sample Output
What a pity!
Wonderful!
Wonderful!
Author
月野兔
题意：
n*m的方格，两个人游戏，起点是左上角，终点是右下角，谁先走到右下角谁赢，kiki总是先走，问谁赢。
思路：
找找规律
P点：就是P个石子的时候，对方拿可以赢(自己输的)
N点：就是N个石子的时候，自己拿可以赢
现在关于P,N的求解有三个规则
（1）：最终态都是P
（2）：按照游戏规则，到达当前态的前态都是N的话，当前态是P
（3）：按照游戏规则，到达当前态的前态至少有一个P的话，当前态是N
题意：
在一个m*n的棋盘内，从(1,m)点出发，每次可以进行的移动是：左移一，下移一，左下移一。然后kiki每次先走，判断kiki时候会赢（对方无路可走的时候）。
我们可以把PN状态的点描绘出来：： 可见都是奇数时是必败点。