CodeForces 630R：Game【水】

最新推荐文章于 2024-06-09 17:02:18 发布

原创最新推荐文章于 2024-06-09 17:02:18 发布 · 538 阅读

0 ·

CC 4.0 BY-SA版权

＝＝＝＝C&＆C++＝＝＝＝专栏收录该内容

153 篇文章

订阅专栏

本文介绍了一个关于游戏理论的问题，在一个n×n的方格中，两名玩家轮流涂色未被染过的格子，但所涂格子不能与已涂格子有共同边。文章探讨了如何选择先手或后手以确保胜利。

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

Game

Time Limit: 500 MS Memory Limit: 65536 KB 64bit IO Format: %I64d & %I64u

Submit Status

Description

There is a legend in the IT City college. A student that failed to answer all questions on the game theory exam is given one more chance by his professor. The student has to play a game with the professor.

The game is played on a square field consisting of n × n cells. Initially all cells are empty. On each turn a player chooses and paint an empty cell that has no common sides with previously painted cells. Adjacent corner of painted cells is allowed. On the next turn another player does the same, then the first one and so on. The player with no cells to paint on his turn loses.

The professor have chosen the field size n and allowed the student to choose to be the first or the second player in the game. What should the student choose to win the game? Both players play optimally.

Input

The only line of the input contains one integer n (1 ≤ n ≤ 10¹⁸) — the size of the field.

Output

Output number 1, if the player making the first turn wins when both players play optimally, otherwise print number 2.

Sample Input

Input

Output

Input

Output

AC-code：

#include<cstdio>
#include<cmath>
int main()
{
	long long n;
	int flag;
	scanf("%lld",&n);
	if(n%2==0)
		flag=2;
	else flag=1;
	printf("%d\n",flag);
	return 0;
}