AtCoder Beginner Contest 004

Submission #1503463

Source codeソースコード

import math
card = [1, 2, 3, 4, 5, 6]
n = int(input())

m = math.floor(n / 5)
n = n % 5
o = m % 30

if n >= 5 and n < 30:
    for i in range(n):
        a = card[0]
        card.pop(0)
        card.append(a)
else:
    for i in range(o):
        a = card[0]
        card.pop(0)
        card.append(a)

for i in range(n):
    if n >= 1:
        card[i], card[i+1] = card[i+1], card[i]
ans = "".join(map(str, card))
print(ans)

Submission

Task問題 C - 入れ替え
User nameユーザ名 NeoooN
Created time投稿日時
Language言語 Python3 (3.4.3)
Status状態 AC
Score得点 100
Source lengthソースコード長 448 Byte
File nameファイル名
Exec time実行時間 17 ms
Memory usageメモリ使用量 3064 KB

Test case

Set

Set name Score得点 / Max score Cases
Subtask1 30 / 30 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 70 / 70 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
SubTask1/00_sample_00.txt AC 17 ms 3064 KB
SubTask1/00_sample_01.txt AC 17 ms 3064 KB
SubTask1/00_sample_02.txt AC 17 ms 3064 KB
SubTask1/rand_19.txt AC 17 ms 3064 KB
SubTask1/rand_2.txt AC 17 ms 3064 KB
SubTask1/rand_25.txt AC 17 ms 3064 KB
SubTask1/rand_27.txt AC 17 ms 3064 KB
SubTask1/rand_33.txt AC 17 ms 3064 KB
SubTask1/rand_35.txt AC 17 ms 3064 KB
SubTask1/rand_4.txt AC 17 ms 3064 KB
SubTask1/rand_44.txt AC 17 ms 3064 KB
SubTask1/rand_48.txt AC 17 ms 3064 KB
SubTask1/rand_8.txt AC 17 ms 3064 KB
SubTask2/00_sample_03.txt AC 17 ms 3064 KB
SubTask2/max_case.txt AC 16 ms 3064 KB
SubTask2/rand_120009641.txt AC 16 ms 3064 KB
SubTask2/rand_134230520.txt AC 16 ms 3064 KB
SubTask2/rand_136939465.txt AC 17 ms 3064 KB
SubTask2/rand_200732473.txt AC 17 ms 3064 KB
SubTask2/rand_211796835.txt AC 16 ms 3064 KB
SubTask2/rand_312330341.txt AC 17 ms 3064 KB
SubTask2/rand_377341731.txt AC 17 ms 3064 KB
SubTask2/rand_384611280.txt AC 17 ms 3064 KB
SubTask2/rand_386098102.txt AC 16 ms 3064 KB
SubTask2/rand_399010727.txt AC 16 ms 3064 KB
SubTask2/rand_409627453.txt AC 17 ms 3064 KB
SubTask2/rand_416537730.txt AC 17 ms 3064 KB
SubTask2/rand_425486442.txt AC 17 ms 3064 KB
SubTask2/rand_493135174.txt AC 16 ms 3064 KB
SubTask2/rand_573105326.txt AC 17 ms 3064 KB
SubTask2/rand_62794810.txt AC 16 ms 3064 KB
SubTask2/rand_649471654.txt AC 17 ms 3064 KB
SubTask2/rand_693017484.txt AC 16 ms 3064 KB
SubTask2/rand_729197057.txt AC 17 ms 3064 KB
SubTask2/rand_759630883.txt AC 16 ms 3064 KB
SubTask2/rand_823752210.txt AC 17 ms 3064 KB
SubTask2/rand_830399384.txt AC 16 ms 3064 KB
SubTask2/rand_893242387.txt AC 16 ms 3064 KB
SubTask2/rand_935005824.txt AC 16 ms 3064 KB
SubTask2/rand_989703310.txt AC 16 ms 3064 KB