hdu 1564 Play a game

Play a game

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2949    Accepted Submission(s): 2402

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*m的棋盘，期中有一个棋子，两人先后挪动棋子，不可以走走过的点，并且只能上下左右，走不了为输。看上去是图，其实和巴什博奕有关，可以把棋盘拆成许多个1X2的单元，两人每一轮操作，都会减少一个1X2的单元，那么就可以得到如果棋盘格子数是偶数，那么就可以将棋盘完整的拆成若干个1X2的单元，那么后者必胜，同理如果是奇数则先者必胜。

#include<set>
#include<map>
#include<cmath>
#include<queue>
#include<stack>
#include<ctime>
#include<cstdio>
#include<vector>
#include<cstring>
#include<cstdlib>
#include<iomanip>
#include<functional>
#include<iostream>
#include<algorithm>
using namespace std;
const long long int MOD=7+1e9;
int main(){
    int n,m;
    while(scanf("%d",&n),n)
    {
        if(n*n%2==1)cout<<"ailyanlu"<<endl;
        else cout<<"8600"<<endl;
    }
    return 0;
}