HDOJ 2147 kiki's game 博弈

最新推荐文章于 2018-08-30 14:56:11 发布

原创最新推荐文章于 2018-08-30 14:56:11 发布 · 630 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#HDOJ 2147 #kikis game #博弈

【OJ】其他算法专栏收录该内容

19 篇文章

订阅专栏

本文介绍了一个名为Kiki's Game的博弈论题目，通过分析游戏规则及使用二维数组标记PN的方法找到了获胜规律。游戏在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): 5884 Accepted Submission(s): 3493

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!

Author

月野兔

Source

HDU 2007-11 Programming Contest

Recommend

威士忌 | We have carefully selected several similar problems for you: 1850 1846 1847 1848 1849

博弈入门题 ^_^ 首先画个二维数组，标记上PN，然后发现P点是有规律的。

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

kdwycz的网站： http://kdwycz.com/

kdwyz的刷题空间：http://blog.youkuaiyun.com/kdwycz