题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1564
Play a game
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2841 Accepted Submission(s): 2309
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?
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.
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.
No other characters should be inserted in the output.
Sample Input
2 0
Sample Output
8600
题目大意:从一个n*n棋盘的左下角出发,能水平竖直方向移动,不能走原来走过的格子,不能走的人输。
解题思路:找规律,n为偶数先手胜,n为奇数后手胜。
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <stack>
#include <algorithm>
#include <map>
using namespace std;
typedef long long ll;
const int N = 100100;
const int M = 50800;
const int INF = 0x3fffffff;
const int mod = 1999993;
const double Pi = acos(-1.0);
const double sm = 1e-9;
int main()
{
int n;
while( ~scanf("%d",&n) ){
if( n == 0 ) break;
if( n % 2 == 0 ) printf("8600\n");
else printf("ailyanlu\n");
}
return 0;
}