hdu 1564 play a game 博弈（规律）

最新推荐文章于 2019-08-15 22:02:39 发布

hpugym

最新推荐文章于 2019-08-15 22:02:39 发布

阅读量570

点赞数

CC 4.0 BY-SA版权

分类专栏：博弈 hdu oj

本文链接：https://blog.youkuaiyun.com/hpugym/article/details/44591039

hdu oj 同时被 2 个专栏收录

106 篇文章

订阅专栏

博弈

3 篇文章

订阅专栏

本文介绍了一个新年棋盘游戏的胜负判断问题。游戏由两名玩家轮流进行，初始时棋盘角落放置一石头，玩家需将石头移至未访问过的相邻格子。文章通过分析得出，当棋盘大小为偶数时，先手玩家8600获胜；反之，后手玩家ailyanlu获胜。

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

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

Author

ailyanlu

Source

Happy 2007

最忌讳博弈题目了。。。

此题规律，是奇数，8600输，是偶数8600胜

#include<stdio.h>
int main()
{
	int n;
	while(scanf("%d",&n),n)
	{
		if((n&1)==0)
		{
			printf("8600\n");
			continue;
		}
		else
		{
			printf("ailyanlu\n");
			continue;
		}
	}
return 0;
}

Problem Description

Input

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