kiki's gameTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 40000/10000 K (Java/Others)Total Submission(s): 8453 Accepted Submission(s): 5036
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
|
以为可以用递推的传统方式解决这题。。。没想到数据量太大,会MLE、、、然后发现其实就是简单的公式法
#include<stdio.h>
int main ()
{
int n,m;
while (scanf("%d%d",&n,&m), n||m )
{
if(n%2&&m%2) printf("What a pity!\n");
else printf("Wonderful!\n");
}
return 0;
}