【B - ECJTU_ACM 11级队员2012年暑假训练赛（2）】

棋盘游戏胜负判断

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

转载最新推荐文章于 2021-06-16 16:49:21 发布 · 112 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/ismdeep/archive/2012/07/10/2584775.html

文章标签：

#开发工具

本文介绍了一个简单的棋盘游戏，玩家需将棋子从右上角移至下方，每次可以向下、向左或对角线移动。游戏由kiki开始，若双方都采取最佳策略，文章提供了判断胜利者的算法。

B - B

Time Limit:1000MS Memory Limit:1000KB 64bit IO Format:%I64d & %I64u

Submit Status

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

5 3 5 4 6 6 0 0

Sample Output

What a pity! Wonderful! Wonderful!

 1 // Project name : B
 2 // File name    : main.cpp
 3 // Author       : Izumu
 4 // Date & Time  : Tue Jul 10 12:31:04 2012
 5 
 6 
 7 #include <iostream>
 8 #include <stdio.h>
 9 #include <string>
10 #include <cmath>
11 using namespace std;
12 
13 int main()
14 {
15     int n, m;
16     while (scanf("%d%d", &n, &m) != EOF && n + m)
17     {
18         if(n % 2 == 0 || m % 2 == 0)
19         {
20             printf("Wonderful!\n");
21         }
22         else
23         {
24             printf("What a pity!\n");
25         }
26     }
27     return 0;
28 }
29 
30 
31 // end 
32 // ism

转载于:https://www.cnblogs.com/ismdeep/archive/2012/07/10/2584775.html