首页 > 代码库 > HDU 2147 kiki's game (巴什博弈)
HDU 2147 kiki's game (巴什博弈)
kiki‘s game
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 40000/1000 K (Java/Others)Total Submission(s): 5982 Accepted Submission(s): 3552
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!
如图就能很容易的看出,只要m或者n有一个是偶数先手就能必胜。
#include <cstdio> #include <cstdlib> #include <cstring> #include <algorithm> using namespace std; int main(){ //freopen("in.txt","r",stdin); //(author : CSDN iaccepted) int n,m; while(scanf("%d %d",&n,&m)!=EOF){ if(n==0 && m==0)break; if(n%2==0 || m%2==0){ printf("Wonderful!\n"); }else{ printf("What a pity!\n"); } } return 0; }
HDU 2147 kiki's game (巴什博弈)
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。