Submission #472113
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i,to) for(li i=0;i<((li)(to));i++)
#define repp(i,start,to) for(li i=(li)(start);i<((li)(to));i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v,n) memset(v,(li)n,sizeof(v))
#define bit(n) (1ll<<(li)(n))
#define mp(a,b) make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b) idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c) idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j) idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v) for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x,n) idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n) idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x) idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x) idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}
#define read2d(a,w,h) rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h) rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}
typedef pair<li, li> PI;
li res[6];
int main() {
li n;
cin>>n;
rep(i,6){
res[i]=(i+(n/5)%6)%6+1;
}
rep(i,n%5){
swap(res[i],res[i+1]);
}
rep(i,6)cout<<res[i];
cout<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 入れ替え |
User |
ynq1242 |
Language |
C++ (G++ 4.6.4) |
Score |
100 |
Code Size |
2241 Byte |
Status |
AC |
Exec Time |
32 ms |
Memory |
1196 KB |
Judge Result
Set Name |
Subtask1 |
Subtask2 |
Score / Max Score |
30 / 30 |
70 / 70 |
Status |
|
|
Set Name |
Test Cases |
Subtask1 |
SubTask1/00_sample_00.txt, SubTask1/00_sample_01.txt, SubTask1/00_sample_02.txt, SubTask1/rand_19.txt, SubTask1/rand_2.txt, SubTask1/rand_25.txt, SubTask1/rand_27.txt, SubTask1/rand_33.txt, SubTask1/rand_35.txt, SubTask1/rand_4.txt, SubTask1/rand_44.txt, SubTask1/rand_48.txt, SubTask1/rand_8.txt |
Subtask2 |
SubTask2/00_sample_03.txt, SubTask2/max_case.txt, SubTask2/rand_120009641.txt, SubTask2/rand_134230520.txt, SubTask2/rand_136939465.txt, SubTask2/rand_200732473.txt, SubTask2/rand_211796835.txt, SubTask2/rand_312330341.txt, SubTask2/rand_377341731.txt, SubTask2/rand_384611280.txt, SubTask2/rand_386098102.txt, SubTask2/rand_399010727.txt, SubTask2/rand_409627453.txt, SubTask2/rand_416537730.txt, SubTask2/rand_425486442.txt, SubTask2/rand_493135174.txt, SubTask2/rand_573105326.txt, SubTask2/rand_62794810.txt, SubTask2/rand_649471654.txt, SubTask2/rand_693017484.txt, SubTask2/rand_729197057.txt, SubTask2/rand_759630883.txt, SubTask2/rand_823752210.txt, SubTask2/rand_830399384.txt, SubTask2/rand_893242387.txt, SubTask2/rand_935005824.txt, SubTask2/rand_989703310.txt |
Case Name |
Status |
Exec Time |
Memory |
SubTask1/00_sample_00.txt |
AC |
30 ms |
1080 KB |
SubTask1/00_sample_01.txt |
AC |
27 ms |
1176 KB |
SubTask1/00_sample_02.txt |
AC |
28 ms |
1080 KB |
SubTask1/rand_19.txt |
AC |
28 ms |
1080 KB |
SubTask1/rand_2.txt |
AC |
28 ms |
1176 KB |
SubTask1/rand_25.txt |
AC |
29 ms |
1176 KB |
SubTask1/rand_27.txt |
AC |
30 ms |
1176 KB |
SubTask1/rand_33.txt |
AC |
27 ms |
1160 KB |
SubTask1/rand_35.txt |
AC |
29 ms |
1196 KB |
SubTask1/rand_4.txt |
AC |
29 ms |
1080 KB |
SubTask1/rand_44.txt |
AC |
27 ms |
1032 KB |
SubTask1/rand_48.txt |
AC |
30 ms |
996 KB |
SubTask1/rand_8.txt |
AC |
30 ms |
1000 KB |
SubTask2/00_sample_03.txt |
AC |
30 ms |
1176 KB |
SubTask2/max_case.txt |
AC |
28 ms |
1080 KB |
SubTask2/rand_120009641.txt |
AC |
28 ms |
1076 KB |
SubTask2/rand_134230520.txt |
AC |
28 ms |
1080 KB |
SubTask2/rand_136939465.txt |
AC |
28 ms |
1172 KB |
SubTask2/rand_200732473.txt |
AC |
27 ms |
1076 KB |
SubTask2/rand_211796835.txt |
AC |
28 ms |
1180 KB |
SubTask2/rand_312330341.txt |
AC |
32 ms |
984 KB |
SubTask2/rand_377341731.txt |
AC |
28 ms |
1076 KB |
SubTask2/rand_384611280.txt |
AC |
28 ms |
1080 KB |
SubTask2/rand_386098102.txt |
AC |
28 ms |
1080 KB |
SubTask2/rand_399010727.txt |
AC |
27 ms |
1168 KB |
SubTask2/rand_409627453.txt |
AC |
31 ms |
1188 KB |
SubTask2/rand_416537730.txt |
AC |
29 ms |
984 KB |
SubTask2/rand_425486442.txt |
AC |
28 ms |
1168 KB |
SubTask2/rand_493135174.txt |
AC |
29 ms |
1192 KB |
SubTask2/rand_573105326.txt |
AC |
29 ms |
1068 KB |
SubTask2/rand_62794810.txt |
AC |
28 ms |
1076 KB |
SubTask2/rand_649471654.txt |
AC |
28 ms |
1172 KB |
SubTask2/rand_693017484.txt |
AC |
28 ms |
1076 KB |
SubTask2/rand_729197057.txt |
AC |
28 ms |
1176 KB |
SubTask2/rand_759630883.txt |
AC |
28 ms |
1080 KB |
SubTask2/rand_823752210.txt |
AC |
28 ms |
1064 KB |
SubTask2/rand_830399384.txt |
AC |
28 ms |
1168 KB |
SubTask2/rand_893242387.txt |
AC |
28 ms |
1180 KB |
SubTask2/rand_935005824.txt |
AC |
27 ms |
1180 KB |
SubTask2/rand_989703310.txt |
AC |
28 ms |
1072 KB |