CodeForces 630R:Game【水】
2016-03-09 18:00
323 查看
Game
Time Limit:500MS Memory
Limit:65536KB 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 ≤ 1018) — 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:
Time Limit:500MS Memory
Limit:65536KB 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 ≤ 1018) — 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
1
Output
1
Input
2
Output
2
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; }
相关文章推荐
- 机器学习
- dataAdapter与dataSet和dataTable的填充
- JS实现的类照片墙图片展示栏&图片循环播放栏
- HDU1735字数统计(贪心)
- IOS_UITableViewCell(UITabel)自动适应Row高
- Android Mediaplayer的使用
- winform子窗体控制父窗体控件
- 选项卡制作问题--折磨了我一整天,记录下来
- Epic Games王祢:UE4在移动平台的开发优势
- Android Studio 工作中用快捷键
- web中父页面与子页面传值的问题
- Effective STL 第一章:容器(四)
- Symmetric Tree
- JNDI配置
- 148.View the Exhibit and examine the structure of the PRODUCTS tables.
- [转]backbone.js 初探
- nginx重启
- 从相册或者相机获得uri转为bitmap
- jedis调用redis之事物
- Tomcat配置虚拟主机的方法