【CodeForces 777A】Shell Game(模拟)
2017-02-25 10:09
435 查看
Shell Game
Problem Description
Bomboslav likes to look out of the window in his room and watch lads outside playing famous shell game. The game is played by two persons: operator and player. Operator takes three similar opaque shells and places a ball beneath one of them. Then he shuffles
the shells by swapping some pairs and the player has to guess the current position of the ball.
Bomboslav noticed that guys are not very inventive, so the operator always swaps the left shell with the middle one during odd moves (first, third, fifth, etc.) and always swaps the middle shell with the right one during even moves (second, fourth, etc.).
Let's number shells from 0 to 2 from
left to right. Thus the left shell is assigned number 0, the middle shell is 1 and
the right shell is 2. Bomboslav has missed the moment when the ball was placed beneath the shell, but he knows that exactly n movements
were made by the operator and the ball was under shell x at the end. Now he wonders, what was the initial
position of the ball?
Input
The first line of the input contains an integer n (1 ≤ n ≤ 2·109) —
the number of movements made by the operator.
The second line contains a single integer x (0 ≤ x ≤ 2) —
the index of the shell where the ball was found after n movements.
Output
Print one integer from 0 to 2 — the index of the shell where the ball was initially
placed.
思路:模拟找规律
Shell Game
Problem Description
Bomboslav likes to look out of the window in his room and watch lads outside playing famous shell game. The game is played by two persons: operator and player. Operator takes three similar opaque shells and places a ball beneath one of them. Then he shuffles
the shells by swapping some pairs and the player has to guess the current position of the ball.
Bomboslav noticed that guys are not very inventive, so the operator always swaps the left shell with the middle one during odd moves (first, third, fifth, etc.) and always swaps the middle shell with the right one during even moves (second, fourth, etc.).
Let's number shells from 0 to 2 from
left to right. Thus the left shell is assigned number 0, the middle shell is 1 and
the right shell is 2. Bomboslav has missed the moment when the ball was placed beneath the shell, but he knows that exactly n movements
were made by the operator and the ball was under shell x at the end. Now he wonders, what was the initial
position of the ball?
Input
The first line of the input contains an integer n (1 ≤ n ≤ 2·109) —
the number of movements made by the operator.
The second line contains a single integer x (0 ≤ x ≤ 2) —
the index of the shell where the ball was found after n movements.
Output
Print one integer from 0 to 2 — the index of the shell where the ball was initially
placed.
思路:模拟找规律
#include<cstdio> using namespace std; int main() { int n,k; int a[6][3]={0,1,2,1,0,2,1,2,0,2,1,0,2,0,1,0,2,1}; scanf("%d%d",&n,&k); n%=6; printf("%d\n",a [k]); return 0; }
相关文章推荐
- Codeforces 777A-Shell Game
- Shell Game (Codeforces-777A)
- Codeforces 777A Shell Game
- CodeForces 777A Shell Game
- Codeforces 469C 24 Game【思维+模拟】
- Codeforces Round #401 (Div. 2) A. Shell Game(模拟)
- Codeforces Beta Round #35 (Div. 2) / 35A Shell Game(模拟)
- CodeForces 703A Mishka and Game(模拟)
- Codeforces - 777A. Shell Game 思维或者模拟
- 【水模拟】#35 A.Shell Game
- cf 777A - A. Shell Game (水)
- Codeforces 2A-Winner(模拟)
- CodeForces - 670D1 Magic Powder - 1 (模拟)
- 实战模拟监控MySQL服务shell脚本小结
- CodeForces - 451C(模拟)
- CF 37 B Computer Game【模拟】
- Codeforces 78C Beaver Game(数论、博弈)
- Codeforces 702D Road to Post Office(模拟 + 公式推导)
- codeforces-755-B PolandBall and Game
- codeforces-305A Strange Addition(思维+模拟)