cp-problemset/CC-CHNO8.cpp at master · ShammiAnand/cp-problemset · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
/*
This code is written by Shammi Anand
contact : shammianand101@gmail.com, shammianand.live
*/
#include <bits/stdc++.h>

using namespace std;

#define ll              long long
#define pb              push_back
#define f               first
#define s               second
#define vi              vector<int>
#define pii             pair<int, int>
#define rep(i,a,n)      for(int i=a;i<n;i++)
#define F(i,n)          for(int i=0;i<n;i++)
#define all(a)          a.begin(), a.end()
// #define INF             1e9+7
#define nl              "\n"
#define w(x)            int x; cin>>x; while(x--)

template<typename T_vector>
void output(const T_vector &v, int start = -1, int end = -1) {
	if (start < 0) start = 0;
	if (end < 0) end = int(v.size());

	for (int i = start; i < end; i++) {
		cout << v[i] << (i < end - 1 ? ' ' : '\n');
	}
}

void shammi() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
}

int main() {
	shammi();
	w(t) {
		ll a, b, n; cin >> a >> b >> n;
		n = n % 6;
		ll series[6] = {a - b, a, b, b - a, -a, -b};
		ll inf = 1e9 + 7;
		ll ans = series[n] % inf;
		// if (n >= 6) {
		// 	// cout << ((series[n % 6] % inf) + inf) % inf << nl;
		// 	ans = ((series[n % 6] % inf));
		// 	if (ans < 0) {
		// 		cout << ans + inf << nl;

		// 	} else cout << ans << nl;
		// } else {
		// 	// cout << ((series[n - 1] % inf) + inf) % inf << nl;
		// 	ans = ((series[n - 1] % inf));
		// 	if (ans < 0) {
		// 		cout << ans + inf << nl;

		// 	} else cout << ans << nl;
		// }
		if (ans < 0) ans += inf;
		cout << ans << nl;
	}
	return 0;
}