hdu2147kiki's game(找规律)

kiki's game

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

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的棋盘，一开始棋子在棋盘右上角，2人轮流走，每次可以向下，向左，左下三个方向走，没得走的那个算输

题解：emm  手写5*3  5*4  6*6的表格，每个点的PN值，很容易看出规律：只要有偶数就是先手赢

 #include<bits/stdc++.h>

 using namespace std;

 int main() {

     int n,m;

     while(~scanf("%d %d",&n,&m)&&n&&m)

     {

         if(n%==||m%==)

         {

             printf("Wonderful!\n");

         }else

         {

             printf("What a pity!\n");

         }

     }

     return ;

 }