hdu2147kiki's game博弈

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

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

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #hdu #博弈

—数论专栏收录该内容

25 篇文章

订阅专栏

本文介绍了一种简单的博弈论游戏，玩家kiki和ZZ在一个n*m的棋盘上进行游戏，游戏从右上角开始，每次可以将棋子向左、向下或左下移动。文章提供了判断完美策略下胜者的算法。

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!

Source

博弈又快忘了，记住了又能怎样……

本题是在方格子中顺着左、下、左下的方向动，若长和宽有一个为偶数，那么kiki就可以顺着这个方向有路可走

#include <iostream>
#include<cstdio>
using namespace std;
int n,m;
int main()
{
    while(cin>>n>>m)
    {
        if(n==0&&m==0) break;
        if(n%2&&m%2)
        puts("What a pity!");
        else
        puts("Wonderful!");
    }
    return 0;
}