B - kiki's game HDU - 2147

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!

最近琪琪没什么事。当她无聊的时候，一个想法出现在他的脑海里，她只是玩棋盘游戏。棋盘的大小是N*M。首先，一枚硬币放在右上角（1，M）。每次一个人可以把硬币移到左边，下面或左下边的空白处。不能移动的人将输掉游戏。

琪琪和zz一起玩。游戏总是从琪琪开始。如果双方都打得很好，谁会赢呢？
输入
输入包含多个测试用例。每行包含两个整数n，m（0<n，m<2000）。当n=0和m=0时，输入终止。
输出
如果kiki赢了游戏输出“Wonderful!”，否则“What a pity!”.

在纸上演算一下很容易找到规律

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <cstring>

using namespace std;

int main(){
	int n,m;
	while(cin >>n>>m && n && m){
		if(n%2==0 || m%2==0)
			printf("Wonderful!\n");
		else 
			printf("What a pity!\n");
	}
	return 0;
}