杭电2147（巴什博奕）

kiki's game

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 40000/1000 K (Java/Others)
Total Submission(s): 6504    Accepted Submission(s): 3869

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!

 

思路：

把棋盘的左下角看成（1,1）那么起始点就是（n,m），
最后谁能得到（1,1）这个点谁就胜，可以看出只要先抢到（奇数，奇数）接下来无论对方怎么走都
会至少有一个坐标是偶数，那么对方就一定会拜，先者有三种走发（n-1,m）,(n,m-1),(n-1,m-1)
只有m和n都是奇数的时候第一步走不出来（奇数，奇数）其余的（只要有一个是偶数）就肯定会得到必胜态
（奇，奇），就会赢。。即一定要要想赢一定要下到（奇， 奇）。
代码：

 1 #include<stdio.h>
 2 #include<stdlib.h>
 3 #include<math.h>
 4 
 5 int main(){
 6     int m, n;
 7     while(scanf("%d %d", &n, &m) && (m || n)){
 8         if(m % 2 != 0 && n % 2 != 0){
 9             printf("What a pity!\n");
10         }
11         else{
12             printf("Wonderful!\n");
13         }
14     }
15     return 0;
16 }

View Code

 

转载于:https://www.cnblogs.com/xiaoyeye/p/3885810.html