博弈——kiki’s game(找规律)
题目链接:
HDU - 2147
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 的棋盘,玩家需要将右上角的硬币走到左下角,方向可以为左、下和左下,谁先走到目标位置谁就取得胜利。
分析
可以先画出 PN 图
从图中可以看出当 n 或者 m 有一个为偶数时,则先手必胜,否则,后手必胜。
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
while(cin>>n>>m&&n&&m){
if(n%2==0||m%2==0){
cout<<"Wonderful!"<<endl;
}
else{
cout<<"What a pity!"<<endl;
}
}
return 0;
}