hdu 2147 kiki's game 博弈基础题

kiki's game

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 40000/1000 K (Java/Others)
Total Submission(s): 6963    Accepted Submission(s): 4165

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!".

 

思路：每一格，对于先手来说，0代必败态，1代表必胜态；
首先能确定（1，1） 对于先手而已，是必败的； 如果在（i，j) 他可以走到一个叫对方必败的状态，那么 （i，j) 为先手的必胜态；
如果在（i,j) 可以走的道路全为对手的必胜态， 那么此（i，j) 为先手的必败态；
打表如下：



发现只有 n m 为奇数是，先手必败；

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<string>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<list>
#include<map>
#include<set>
using namespace std;

int n, m;
bool state[2010][2010];


//void work(){
//
//    int fi = 1, se = 0;
//    for(int i = 1; i <= m; i++)
//         state[1][i] = !(i & 1);
//    for(int i = 2; i <= n; i++){
//        swap(fi, se);
//        state[i][1] = ! (i & 1);
//        for(int j = 2; j <= m; j++){
//            if(state[i][j - 1] && state[i - 1][j] && state[i - 1][j - 1])
//                state[i][j] = 0;
//            else state[i][j] = 1;
//        }
//    }
//    if(state[fi][m] == 1) printf("Wonderful!\n");
//    else printf("What a pity!\n");
//    for(int i = n; i > 0; i--){
//        printf("i=%2d: ", i);
//        for(int j = 1; j <= m; j++)
//            printf("%d ", state[i][j]);
//        cout << endl;
//    }C
//}
int main()
{

//	freopen("in.txt","r",stdin);
    while(~scanf("%d%d", &n, &m) && n + m){
//        work();
        if((n & 1) && (m & 1)) printf("What a pity!\n");
        else printf("Wonderful!\n");
    }

	return 0;
}