HDU2147 - kiki's game 【巴什博弈】

最新推荐文章于 2025-09-10 15:47:18 发布

weixin_30399821

最新推荐文章于 2025-09-10 15:47:18 发布

阅读量76

点赞数

CC 4.0 BY-SA版权

文章标签：开发工具

原文链接：http://www.cnblogs.com/aerer/p/9931000.html

本文介绍了一种简单而有效的算法，用于判断在一个特定规则下的棋盘游戏中，两个玩家kiki和ZZ谁将获胜。通过分析棋盘的大小和游戏规则，文章揭示了胜利的关键在于棋盘的某维是否为偶数，这为理解游戏策略提供了清晰的指导。

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!

思路：因为行列分别要走m-1和n-1步，所以要保证至少m和n其中有一个是2的倍数，这样才能保证赢

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

转载于:https://www.cnblogs.com/aerer/p/9931000.html