kiki's game

Time Limit : 5000/1000ms (Java/Other)   Memory Limit : 40000/1000K (Java/Other)

Total Submission(s) : 75   Accepted Submission(s) : 50

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 35 46 60 0

 

Sample Output

What a pity!Wonderful!Wonderful!

 

Author

月野兔

 

Source

HDU 2007-11 Programming Contest

 

对于P点,N点理解得还不够, 别人说的又不统一,又貌似不正确. 目前自己是这样理解的,也不一定对: 

0.终点是P点

1.N点: 至少有一种方式能做出N→P动作

2.P点: 只能做出P→N动作

对于此题附上一图:

当且仅当m和n同时为基数是kiki一开始才处于P点, 所以...

#include<cstdio>#include<algorithm>using namespace std;int main(){int n, m;while (scanf("%d%d", &n, &m) && n != 0){printf("%s\n", (m%2==1&&n%2==1) ? "What a pity!" :"Wonderful!" );}return 0;}