题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2147
题目:
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!
我们可以寻找必败态和必胜态,我们假设必败态是P,必胜态是N,那么当
、
时,必胜态必败态矩阵如下:
NNNNNNNNN
PNPNPNPNP
NNNNNNNNN
PNPNPNPNP
NNNNNNNNN
PNPNPNPNP
NNNNNNNNN
PNPNPNPNP
多试几组样例,我们可以很容易的发现,当
和
都为奇数的时候,按照题意,应输出“What a pity!”,否则输出“Wonderful!”。
NNNNNNNNN
PNPNPNPNP
NNNNNNNNN
PNPNPNPNP
NNNNNNNNN
PNPNPNPNP
NNNNNNNNN
PNPNPNPNP
多试几组样例,我们可以很容易的发现,当
#include <iostream>
#include<cstdio>
using namespace std;
int main()
{
int n,m;
while(~scanf("%d%d",&n,&m)&&(n||m))
{
if((n&1)&&(m&1)) cout<<"What a pity!"<<endl;
else cout<<"Wonderful!"<<endl;
}
}