HDU 2147———简单博弈

题目:

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!

题意： 

   给你矩形的长和宽，让你从右上角走到左下角，每次走一步有三种选择，向左，向下，向左下。kiki先走，判断kiki是否有必胜策略，如果有，则输出"Wonderful!"

否则输出"What a pity!".

分析：

   这道题是队友告诉的，刚开始并没有搞懂，然后问他说，判断输入的n和m,如果n和m都是奇数，则输出"What a pity!"，否则都输出"Wonderful!"。没弄明白为啥。。

#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;
}