![]() | ||||||||||
| ||||||||||
| ||||||||||
kiki's gameTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 40000/1000 K (Java/Others)Total Submission(s): 6405 Accepted Submission(s): 3803
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
Sample Output
Author
月野兔
Source
Recommend
| ||||||||||
|
博弈:NP问题 别看代码短,必须要找到规律。。
题解嘛,有空再补。。。
#include <stdio.h>
using namespace std;
int main(){ freopen("kiki.in","r",stdin);
int a, b;
while( ~scanf("%d%d", &a, &b) && a && b ){
if( a&1 && b&1 ) printf("What a pity!\n");
else printf("Wonderful!\n");
}
return 0;
}