HDU-2147-kiki's game 【巴什博弈】

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=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 35 46 60 0

 

Sample Output

What a pity!Wonderful!Wonderful!

题目分析：一个n*m的表格，起始位置为右上角，目标位置为左下角，规则是向左，向下或者向左下（对角线）走一格。不能再走的人就输了，也就是说先到达左下角的人获胜。

kiki一定要走奇数步才能赢。所以她所在的图一定要是偶数!   从右上角开始扩展画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<<"Wonderful!"<<endl;elsecout<<"What a pity!"<<endl;}return 0;}