hdoj--2147--kiki's game

kiki's game

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

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

题意:有一个n*m的棋盘，右上角有一个棋子，每次可以向左或者向下或者向左下移动，然后求先移动的人会赢还是会输

画出表格找出必胜点还有必败点，规律是只要n还有m有一个偶数就不会输

  
  

   
   What a pity!
Wonderful!
Wonderful!
  
  

#include<cstdio>
#include<cstring>
int main()
{
	int n,m;
	while(scanf("%d%d",&n,&m),m+n)
	{
		if(n%2==0||m%2==0)
			printf("Wonderful!\n");
		else
			printf("What a pity!\n");
	}
	return 0;
}