kiki‘s game

Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 40000/1000 K (Java/Others)

Total Submission(s): 238 Accepted Submission(s): 41

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

月野兔

Source

HDU 2007-11 Programming Contest

Recommend

威士忌

大意：

唯一需要注意的一点是可以往3个方向走：左，下，左下角

思路：

画出NP图即可，画NP图时，从终点一层层地往外推即可（运用NP的性质）

（横轴坐标从右往左递增，纵轴坐标从下往上递增）

由此可见，nm都是奇数时，为必败局面

另外，我可能做了假题。。。证据如下：

这是志远兄做的时候的内存限制，10000K

下面的是我的：

MD，1000K。。。。。整整差了10倍。。。。。

最后用java过的。。。。。。

坑。。。。MD。。。。。。

C一直就是MLE，整的我脸都绿了。。。。。

HDU 2147--HDU 2147（博弈）--我可能做了假题。。。