hdu 2147 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!

题意：给你一个n*m的棋盘，一个棋子起始位置是（1，m），在不越界的情况下，你可以向左，或向下，或向左下走一格，kiki和ZZ两人轮流走，谁先走到（n，m）处谁赢，kiki先走。

思路：
p表示先手必败点，N表示先手必胜点，易看出，如果n，m全为奇数时，先手必败，否则先手必胜。

代码如下

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <string>

using namespace std;

int main()
{
    int n,m;
    while(1)
    {
        cin>>n>>m;
        if(!(n+m)) 
        break;
        if(n%2==0||m%2==0)
        cout<<"Wonderful!"<<endl;
        else 
        cout<<"What a pity!"<<endl;
    }
    return 0;
}