hdu_oj1564Play a game（寻找奇异局）

Problem Description

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刚开始可以走的个数为n*n-1，如果n为偶数n*n-1为奇数，则先手必胜，否则后手必胜

附上AC代码

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
using namespace std;
typedef long long ll;
int main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    ll n;
    while(cin>>n&&n!=0)
    {
        if(n%2==0)
            cout<<"8600"<<endl;
        else
            cout<<"ailyanlu"<<endl;
    }
    return 0;
}