Submission #7094647
Source Code Expand
#include <bits/stdc++.h> #define ll long long #define rep(X,N) for(ll X = 0; X < (N); X++) #define pback push_back #define mpair make_pair #define MODN 1000000007 using namespace std; #define ull long long int main(){ //5回で先頭のカードが一番後ろに行く //それを6回行うと最初の状態に戻る int n; cin >> n; n = n % 30; int card[6] = {1,2,3,4,5,6}; rep(i,n){ int l = i % 5; int r = (i % 5) + 1; int tmp = card[r]; card[r] = card[l]; card[l] = tmp; } cout << card[0] << card[1] << card[2] << card[3] << card[4] << card[5] << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 入れ替え |
User | goto_isyuku_dev |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 695 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 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 | 1 ms | 256 KB |
SubTask1/00_sample_01.txt | AC | 1 ms | 256 KB |
SubTask1/00_sample_02.txt | AC | 1 ms | 256 KB |
SubTask1/rand_19.txt | AC | 1 ms | 256 KB |
SubTask1/rand_2.txt | AC | 1 ms | 256 KB |
SubTask1/rand_25.txt | AC | 1 ms | 256 KB |
SubTask1/rand_27.txt | AC | 1 ms | 256 KB |
SubTask1/rand_33.txt | AC | 1 ms | 256 KB |
SubTask1/rand_35.txt | AC | 1 ms | 256 KB |
SubTask1/rand_4.txt | AC | 1 ms | 256 KB |
SubTask1/rand_44.txt | AC | 1 ms | 256 KB |
SubTask1/rand_48.txt | AC | 1 ms | 256 KB |
SubTask1/rand_8.txt | AC | 1 ms | 256 KB |
SubTask2/00_sample_03.txt | AC | 1 ms | 256 KB |
SubTask2/max_case.txt | AC | 1 ms | 256 KB |
SubTask2/rand_120009641.txt | AC | 1 ms | 256 KB |
SubTask2/rand_134230520.txt | AC | 1 ms | 256 KB |
SubTask2/rand_136939465.txt | AC | 1 ms | 256 KB |
SubTask2/rand_200732473.txt | AC | 1 ms | 256 KB |
SubTask2/rand_211796835.txt | AC | 1 ms | 256 KB |
SubTask2/rand_312330341.txt | AC | 1 ms | 256 KB |
SubTask2/rand_377341731.txt | AC | 1 ms | 256 KB |
SubTask2/rand_384611280.txt | AC | 1 ms | 256 KB |
SubTask2/rand_386098102.txt | AC | 1 ms | 256 KB |
SubTask2/rand_399010727.txt | AC | 1 ms | 256 KB |
SubTask2/rand_409627453.txt | AC | 1 ms | 256 KB |
SubTask2/rand_416537730.txt | AC | 1 ms | 256 KB |
SubTask2/rand_425486442.txt | AC | 1 ms | 256 KB |
SubTask2/rand_493135174.txt | AC | 1 ms | 256 KB |
SubTask2/rand_573105326.txt | AC | 1 ms | 256 KB |
SubTask2/rand_62794810.txt | AC | 1 ms | 256 KB |
SubTask2/rand_649471654.txt | AC | 1 ms | 256 KB |
SubTask2/rand_693017484.txt | AC | 1 ms | 256 KB |
SubTask2/rand_729197057.txt | AC | 1 ms | 256 KB |
SubTask2/rand_759630883.txt | AC | 1 ms | 256 KB |
SubTask2/rand_823752210.txt | AC | 1 ms | 256 KB |
SubTask2/rand_830399384.txt | AC | 1 ms | 256 KB |
SubTask2/rand_893242387.txt | AC | 1 ms | 256 KB |
SubTask2/rand_935005824.txt | AC | 1 ms | 256 KB |
SubTask2/rand_989703310.txt | AC | 1 ms | 256 KB |