D - kiki's game

最新推荐文章于 2021-05-11 13:29:50 发布

原创最新推荐文章于 2021-05-11 13:29:50 发布 · 156 阅读

0 ·

CC 4.0 BY-SA版权

博弈论专栏收录该内容

23 篇文章

订阅专栏

本文介绍了一种简单的博弈游戏，玩家在棋盘上移动硬币，目标是在对手无法移动时赢得游戏。通过分析游戏规则，文章提供了一个快速判断初始状态胜负的算法。

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
5 3
5 4
6 6
0 0
Sample Output
What a pity!
Wonderful!
Wonderful!

简单博弈

#include<iostream>
using namespace std;
int main(int argc, char const *argv[]) {
  int n,m;
  while (~scanf("%d %d",&n,&m)&&n!=0&&m!=0) {
    int res=n*m-1;
    if(res&1) puts("Wonderful!");
    else puts("What a pity!");
  }
  return 0;
}