hdu-2147-kiki's game-博弈论-java

kiki's game

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 40000/10000 K (Java/Others)
Total Submission(s): 10788    Accepted Submission(s): 6540


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
  
  
5 3 5 4 6 6 0 0
 

Sample Output
  
  
What a pity! Wonderful!

Wonderful!

解题思路:题目大意两个人轮流在n*m的方格上移动从右上角看谁先到达左下角

经典的巴什博奕从左下角开始逆推

因为两个人轮流走并且每次只走一步所以输赢状态轮流交替

用图形表示就是

输 赢 输 赢 输

赢 赢

输 输

赢 赢

输 赢 输 赢 输

中间的格子无需考虑不影响解题

四条边上都是一个输一个赢

所以当n和m都为奇数时 右上角的状态为必输

那么这题就解完了

ac代码:

import java.util.Scanner; public class Main { public static void main(String[] args) { // TODO 自动生成的方法存根         Scanner scanner = new Scanner(System.in);         while (scanner.hasNext()) { int a = scanner.nextInt(); int b = scanner.nextInt(); if (a==0&&b==0) { return; } if (a%2==1&&b%2==1) { System.out.println("What a pity!"); }else { System.out.println("Wonderful!"); } } } }

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值