HDU2147 kiki's game

最新推荐文章于 2019-07-29 10:44:00 发布

原创最新推荐文章于 2019-07-29 10:44:00 发布 · 205 阅读

0 ·

CC 4.0 BY-SA版权

博弈论专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一种简单的棋盘游戏，玩家通过特定规则移动棋子，先手玩家在特定条件下可以确保胜利。文章提供了游戏规则说明及胜负判断的简易算法。

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=2147

kiki’s game

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

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!

题解

依然是手推PN图系列：

可以看出，只要 $n,m$ 中有一个偶数就是先手必胜。

代码

#include<bits/stdc++.h>
using namespace std;
int n,m;
void ac()
{
    if(n%2&&m%2)
    printf("What a pity!\n");
    else printf("Wonderful!\n");
}
int main()
{
    while(scanf("%d%d",&n,&m)&&n&&m)ac();
    return 0;
}