kiki's game+hdu+简单巴什博弈

最新推荐文章于 2020-12-09 12:37:38 发布

原创最新推荐文章于 2020-12-09 12:37:38 发布 · 509 阅读

0 ·

CC 4.0 BY-SA版权

博弈论专栏收录该内容

5 篇文章

订阅专栏

本文探讨了在特定棋盘游戏中，玩家Kiki与ZZ之间的博弈策略，通过分析棋盘大小对胜利者的影响，揭示了当n和m均为奇数时，Kiki将面临失败的局面。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

kiki's game

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

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都为奇数时，kiki必败。
code：#include <iostream>
#include<cstdio>
using namespace std;

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