Submission #3776313

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define REPO(i, n) for(int i = 1;i <= n;i++)
#define ll long long
#define INF 999999999
#define MINF -999999999

int main() {
	ll a,b;
	int u[6] = { 1,2,3,4,5,6 };
	cin >> a;
	a = a % 30;
	REP(i, a) {
		b = u[(i % 5)];
		u[(i % 5)] = u[(i % 5) + 1];
		u[(i % 5) + 1] = b;
	}
	REP(i, 6) cout << u[i];
	cout << endl;
}

Submission Info

Judge Result