HDU 2147 kiki's game （巴什博弈）

最新推荐文章于 2026-07-22 14:00:14 发布

原创最新推荐文章于 2026-07-22 14:00:14 发布 · 356 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

HDU

---巴什博弈

本文介绍了一个两人轮流移动棋子的游戏，棋子从右上角出发，每次可向左、向下或左下方移动，无法移动者输。通过分析，得出当棋盘尺寸n和m均为奇数时为必败状态，否则为必胜状态。

kiki's game

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

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

Sample Output

What a pity!
Wonderful!
Wonderful!

题意：两个人进行游戏，一个棋子开始在右上角，只能往左，左下，下三个方向走，两个人轮流走，谁先不能走就输了。

思路：左下角是必败态，那么能走到左下角的都是必胜态....可以发现如果n，m都是奇数，那么就是必败，否则就是必胜。

#include <iostream>
#include<queue>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<set>
#include<cstring>
using namespace std;
#define LL long long
int n,m,a,b,c,e,f,g,x,y;

int main()
{
	while(cin>>n>>m,n+m)
    {
        if(n%2&&m%2) cout<<"What a pity!"<<endl;
        else cout<<"Wonderful!"<<endl;
    }
    return 0;
}