1016: Roliygu and Yilan

最新推荐文章于 2023-10-29 23:00:13 发布

xianxia_chen

最新推荐文章于 2023-10-29 23:00:13 发布

阅读量893

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/xianxia_chen/article/details/79210667

本文介绍了一个关于两人棋盘游戏的算法问题，玩家需将棋盘角落的棋子通过水平或垂直移动到达未访问过的格子，无法移动者输。文章提供了一段C++代码示例，用于判断在完美策略下哪位玩家会获胜。

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

题目描述：

Roliygu is famous because he likes to play games. Today he puts a chessboard in the desktop,and plays a game with Yilan. The size of the chessboard is n by n. A stone is placed in a corner square. They play alternatively with Roliygu 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?

输入：

The input is a sequence of positive integers each in a separate line. The integers are between 1 and 10 000,inclusive,indicating the size of the chessboard. The end of the input is indicated by a zero.

输出：

Output the winner("Roliygu" or "Yilan") for each input line except the last zero. No other characters should be inserted in the output.

样例输入

2
0

样例输出

Roliygu

提示

染色问题

提交

#include<iostream>
using namespace std;
int main() {
	int n;
	while(cin>>n&&n!=0) {
		if((n*n)%2==0) {
			cout<<"Roliygu"<<endl;
		} else {
			cout<<"Yilan"<<endl;
		}
	}
	return 0;
}

要点

两个人都是发挥完美,于是按照最简单的路径完成，路径长度n*n，除2求余便可得出先后。