【博弈】hdoj2147 kiki's game

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 3 5 4 6 6 0 0

 

 

Sample Output

What a pity! Wonderful! Wonderful!

 

分析：

N：必胜点（如果左边，左下角，下角有一个P点，那么这个点就是N点）

P：必败点（如果左边，左下角，下角全都是N点，那么这个点就是P点）

  (1) 所有终结点是必败点（P点）；

  (2) 从任何必胜点（N点）操作，至少有一种方法可以进入必败点（P点）；

  (3)无论如何操作，从必败点（P点）都只能进入必胜点（N点）.

最后棋子一定到达（n,m）这个点，所以我们从这个点是必败点，从这里开始画出NP图

找到规律得，行数和列数只要有一个偶数，就能赢。

代码如下：

#include<stdio.h>
int main()
{int n,m;
while(scanf("%d%d",&n,&m),n+m)
    {if(n%2==0||m%2==0) printf("Wonderful!\n");
    else printf("What a pity!\n");
    }
return 0;
}