HDU 1564 Play a game（博弈找规律）

最新推荐文章于 2019-07-27 19:42:40 发布

围巾的ACM

最新推荐文章于 2019-07-27 19:42:40 发布

阅读量350

点赞数

CC 4.0 BY-SA版权

分类专栏：博弈

本文链接：https://blog.youkuaiyun.com/qq_21057881/article/details/51814286

博弈专栏收录该内容

23 篇文章

订阅专栏

本文介绍了一种简单的棋盘游戏，玩家轮流移动角落里的棋子到未访问过的相邻格子。文章通过分析得出，当棋盘大小为偶数时先手玩家必胜，奇数时后手玩家必胜。并提供了C++实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

思路：大概画了几盘...n为偶数的时候就是先手必胜，奇数就是后手必胜

#include<bits/stdc++.h>
using namespace std;

int main()
{
	int n;
	while(scanf("%d",&n)!=EOF && n)
	{
		if(n%2==0)
			cout << "8600" << endl;
		else
			cout << "ailyanlu" << endl;
	}
}

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