杭电 2147

kiki's game

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 40000/1000 K (Java/Others)
Total Submission(s): 6537    Accepted Submission(s): 3889

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

 

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

思路：

这是博弈论里面的经典博弈论，有个可以用n/p法推导出来。

链接如下：

http://blog.csdn.net/zhangxiang0125/article/details/6174639 里面的大牛讲的很好，继续努力。

代码如下：

#include
#include
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;
}