Submission #132151

---

Source Code Expand

#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
#include <complex>
#include <map>
using namespace std;

#define rep(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define EPS 1e-8
#define F first
#define S second

static const double PI=6*asin(0.5);
typedef long long ll;
typedef complex<double> CP;
typedef pair<int,int> P;
static const int INF=1<<24;

int main(){
	vector<int> a;
	
	int n;
	cin>>n;
	rep(i,6){
		a.PB(i);
	}
	
	n%=30;
	rep(i,n){
		int x=(i%5),y=(i%5)+1;
		int t=a[x];
		a[x]=a[y];
		a[y]=t;
	}
	rep(i,6){
		cout<<a[i]+1;
	}
	cout<<endl;
	return 0;
}

Submission Info

Judge Result