博弈——Play a game(找规律)
题目链接:
HDU - 1564
New Year is Coming!
ailyanlu is very happy today! and he is playing a chessboard game with 8600.
The size of the chessboard is n*n. A stone is placed in a corner square. They play alternatively with 8600 having the first move. Each time, player is allowed to move the stone to an unvisited neighbor square horizontally or vertically. The one who can’t make a move will lose the game. If both play perfectly, who will win the game?
Input
The input is a sequence of positive integers each in a separate line.
The integers are between 1 and 10000, inclusive,(means 1 <= n <= 10000) indicating the size of the chessboard. The end of the input is indicated by a zero.
Output
Output the winner (“8600” or “ailyanlu”) for each input line except the last zero.
No other characters should be inserted in the output.
Sample Input
2
0
Sample Output
8600
题目大意
有一个 n * n 的棋盘,一块石头放在一个角落,玩家可以将石头水平或垂直的移动到石头没有到达过的地方,不能移动的人就输了,8600先手。
分析
这题感觉比较简单,可以发现当 n 为偶数时,先手赢,当 n 为奇数时,后手赢。
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
while(cin>>n&&n){
if(n%2==0){
cout<<"8600"<<endl;
}
else{
cout<<"ailyanlu"<<endl;
}
}
return 0;
}