Codeforces Round #401 (Div. 2) A. Shell Game

A. Shell Game

Problem Statement

    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·10^9$) — 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.

Examples

Example 1
    Input
        4
        2
    Output
        1
Example 2
    Input
        1
        1
    Output
        0

Note

    In the first sample, the ball was initially placed beneath the middle shell and the operator completed four movements.

    1.During the first move operator swapped the left shell and the middle shell. The ball is now under the left shell.
    2.During the second move operator swapped the middle shell and the right one. The ball is still under the left shell.
    3.During the third move operator swapped the left shell and the middle shell again. The ball is again in the middle.
    4.Finally, the operators swapped the middle shell and the right shell. The ball is now beneath the right shell.

题意

    有一个人在和另一个人玩一个游戏，一个人将一个球放在其中一个杯子里，杯子标号为0,1,2，然后进行n次操作，当目前操作次数是奇数次时，他会将编号为0和1的杯子互换，而当目前操作次数是偶数次时，他会将编号为1和2的杯子互换。现在他知道了操作次数和球最后所在的杯子，问你一开始球在哪个杯子里。

思路

    首先我们可以先手模一下，发现他的交换次数是6次一个循环的，之后只要打个表就行了..

Code

#pragma GCC optimize(3)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
inline void readInt(int &x) {
    x=0;int f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    x*=f;
}
inline void readLong(ll &x) {
    x=0;int f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    x*=f;
}
/*================Header Template==============*/
int n,x;
int pos[6][3]={{0,1,2},
               {1,0,2},
               {1,2,0},
               {2,1,0},
               {2,0,1},
               {0,2,1}};
int main() {
    readInt(n);
    readInt(x);
    printf("%d\n",pos[n%6][x]);
    return 0;
}