HDU--1564 -- play a game [博弈]

最新推荐文章于 2021-04-08 22:55:00 发布

原创最新推荐文章于 2021-04-08 22:55:00 发布 · 729 阅读

0 ·

CC 4.0 BY-SA版权

ACM 专栏收录该内容

95 篇文章

订阅专栏

本文介绍了一个简单的棋盘游戏胜负判断算法。在一个n*n的棋盘上，初始时一颗棋子放在角落，两名玩家交替移动棋子至相邻未访问过的格子。文章提供了一个C语言实现的示例代码，用于判断当双方都采取最优策略时，哪一方会赢得比赛。

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

Play a game

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

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

Code:

在一条边上从一个端点到另一个端点，判断其奇偶

另一条边是一样的，这两条边是最短路径，如果绕路，必为偶数，所以不用判断了~

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