【Codeforces】1208A. XORinacci

题目描述

Cengiz recently learned Fibonacci numbers and now he is studying different algorithms to find them. After getting bored of reading them, he came with his own new type of numbers that he named XORinacci numbers. He defined them as follows:

• f(0)=af(0)=a;
• f(1)=bf(1)=b;
• f(n)=f(n−1)⊕f(n−2)f(n)=f(n−1)⊕f(n−2) when n>1n>1, where ⊕⊕ denotes the bitwise XOR operation.

You are given three integers aa, bb, and nn, calculate f(n)f(n).

You have to answer for TT independent test cases.

Input

The input contains one or more independent test cases.

The first line of input contains a single integer TT (1≤T≤1031≤T≤103), the number of test cases.

Each of the TT following lines contains three space-separated integers aa, bb, and nn (0≤a,b,n≤1090≤a,b,n≤109) respectively.

Output

For each test case, output f(n)f(n).

Example

input

3
3 4 2
4 5 0
325 265 1231232

output

7
4
76

Note

In the first example, f(2)=f(0)⊕f(1)=3⊕4=7f(2)=f(0)⊕f(1)=3⊕4=7.

题解

打表找规律即可。

代码

#include<iostream>
using namespace std;

int a,b,n;

int main()
{
    int T;
    cin>>T;
    while(T--){
        cin>>a>>b>>n;
        int ans=0;
        switch(n%3){
            case 0:ans=a;break;
            case 1:ans=b;break;
            case 2:ans=a^b;break;
        }
        cout<<ans<<endl;
    }
    return 0;
}