HDU 2147 kiki's game(取石子游戏 + 经典博弈)

kiki's game

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 40000/10000 K (Java/Others)
Total Submission(s): 9570    Accepted Submission(s): 5745

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!
  
  

 

Author

月野兔

 

Source

HDU 2007-11 Programming Contest

 

对于取石子问题的处理步骤:

步骤1:将所有终结位置标记为必败点（P点）；
步骤2: 将所有一步操作能进入必败点（P点）的位置标记为必胜点（N点）
步骤3:如果从某个点开始的所有一步操作都只能进入必胜点（N点） ，则将该点标记为必败点（P点） ；
步骤4: 如果在步骤3未能找到新的必败（P点），则算法终止；否则，返回到步骤2。

如此，我们通过寻找规律发现，只要n,m是奇数就可以赢否则则输。

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
int n, m;
int main(){
    while(~scanf("%d%d", &n, &m), n && m){
        if(n % 2 == 1 && m % 2 ==1){
            printf("What a pity!\n");
        }
        else {
            printf("Wonderful!\n");
        }
    }
    return 0;
}