kiki's game

Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 40000/1000 K (Java/Others)
Total Submission(s): 5982 Accepted Submission(s): 3552


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

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的表格，起始位置為右上角，目標位置為左下角，甲先開始走，走的規則是可以向左，向下或者向左下（對頂的）走一格。誰先走到目標位置誰就勝利。在甲乙都采用最佳策略的時候，先走者能否獲勝。也是一個巴什博弈的題目。首先畫出PN圖，

如圖就能很容易的看出，只要m或者n有一個是偶數先手就能必勝。

#include 
#include 
#include 
#include 

using namespace std;

int main(){
    //freopen("in.txt","r",stdin);
    //(author : CSDN iaccepted)

    int n,m;
    while(scanf("%d %d",&n,&m)!=EOF){
        if(n==0 && m==0)break;
        if(n%2==0 || m%2==0){
            printf("Wonderful!\n");
        }else{
            printf("What a pity!\n");
        }
    }
    return 0;
}