HDU_2147 kiki's game

最新推荐文章于 2021-06-16 16:49:21 发布

原创最新推荐文章于 2021-06-16 16:49:21 发布 · 389 阅读

0 ·

CC 4.0 BY-SA版权

HDOJ基础同时被 2 个专栏收录

83 篇文章

订阅专栏

博弈

6 篇文章

订阅专栏

本文介绍了一款奇奇与ZZ对弈的棋盘游戏，通过分析游戏规则得出获胜策略。当棋盘大小为n*m且n和m均为奇数时，先手玩家将无法赢得游戏。

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

kiki's game

2014-8-7 10:15

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!

此题的关键在于画出PN图就一切明朗了：

	1	2	3	4	5	6	7
1	P	N	P	N	P	N	P
2	N	N	N	N	N	N	N
3	P	N	P	N	P	N	P
4	N	N	N	N	N	N	N
5	P	N	P	N	P	N	P
6	N	N	N	N	N	N	N
7	P	N	P	N	P	N	P

所以对于n*m的棋盘，只有在n和m都是奇数的时候才会出现P，也即是说n和m均奇数的时候先走的必败

#include<stdio.h>
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m),!(n==0&&m==0))
    {
       if((n&1)&&(m&1))  printf("What a pity!\n");
       else printf("Wonderful!\n");
    }
    return 0;
}