kiki's game（hdu2147）

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的表格，起始位置为右上角，目标位置为左下角，甲先开始走，走的规则
   
   
是可以向左，向下或者向左下（对顶的）走一格。谁先走到目标位置谁就胜利。在甲乙
   
   
都采用最佳策略的时候，先走者能否获胜。

   
   


   
   


   
   
这是一个巴什博弈，画出PN图就会发现当n或m为偶数是为必胜态
   
   


   
   
#include <iostream>


using namespace std;


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