【 数论 博弈 】HDU 2147 kiki's game

kiki's game

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 40000/10000 K (Java/Others)
Total Submission(s): 12091    Accepted Submission(s): 7366

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!

题意：给一个n*m的网格，从（1,m）走到（n,1）. 可以往左走一步，或者向下走一步，或者像斜下方走一步。给出n,m问先手必赢还是后手必赢？

思路：Bash Game .. emmm我也不知道我怎么想到的，就是（1，1）（1，2）（2，2）（2，3）（3，3）..试了试？

...

#include<stdio.h>
int main()
{
	int n,m;
	while(~scanf("%d%d",&n,&m))
	{
		if ( n==0 && m==0) break;
		if(n%2 && m%2) printf("What a pity!\n");//先手必输
		else printf("Wonderful!\n");//先手必赢
	} 
 }