hdu2147——kiki's game（博弈论）

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
What a pity!
Wonderful!
Wonderful!

设p为后手赢的情况，n为先手赢的情况。在棋盘上画出走的情况，易得m==1,n==1时，只有一个p，当n==2,m==2时，除了右上角为p,其余全为n，因为只要走一步就到达终点

#include <iostream>
#include <vector>
#include <cstring>
#include <cstdio>
#include <algorithm>
#include <queue>
#define MAXN 505
using namespace std;
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m)&&(n&&m))
    {
        if(n%2&&m%2)
            cout<<"What a pity!"<<endl;
        else
            cout<<"Wonderful!"<<endl;
    }
    return 0;
}