結果
問題 | No.2256 Step by Step |
ユーザー | shobonvip |
提出日時 | 2023-01-27 23:25:02 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,442 bytes |
コンパイル時間 | 220 ms |
コンパイル使用メモリ | 82,048 KB |
実行使用メモリ | 62,080 KB |
最終ジャッジ日時 | 2024-06-28 08:16:55 |
合計ジャッジ時間 | 4,176 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
52,736 KB |
testcase_01 | AC | 42 ms
52,736 KB |
testcase_02 | WA | - |
testcase_03 | AC | 49 ms
62,080 KB |
testcase_04 | AC | 49 ms
62,080 KB |
testcase_05 | AC | 50 ms
61,696 KB |
testcase_06 | AC | 40 ms
52,736 KB |
testcase_07 | AC | 40 ms
52,480 KB |
testcase_08 | AC | 40 ms
52,864 KB |
testcase_09 | WA | - |
testcase_10 | AC | 43 ms
52,992 KB |
testcase_11 | WA | - |
testcase_12 | AC | 46 ms
60,032 KB |
testcase_13 | AC | 48 ms
61,440 KB |
testcase_14 | WA | - |
testcase_15 | AC | 46 ms
60,160 KB |
testcase_16 | AC | 41 ms
52,992 KB |
testcase_17 | AC | 49 ms
61,440 KB |
testcase_18 | WA | - |
testcase_19 | AC | 50 ms
61,568 KB |
testcase_20 | AC | 45 ms
60,416 KB |
testcase_21 | AC | 46 ms
60,032 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 46 ms
60,032 KB |
testcase_25 | AC | 47 ms
60,160 KB |
testcase_26 | WA | - |
testcase_27 | AC | 47 ms
60,224 KB |
testcase_28 | AC | 41 ms
52,816 KB |
testcase_29 | AC | 41 ms
53,248 KB |
testcase_30 | AC | 47 ms
60,672 KB |
testcase_31 | AC | 41 ms
53,248 KB |
ソースコード
n = int(input()) #繰り返し前のテンプレ tenple = [ [0, 1, 1, 4, 2, 1], [2, 3, 3, 4, 3, 0], [4, 2, 0] ] # 基本の繰り返し系 rep = [ [2, 1, 0], [1, 3, 3, 2, 3, 0], [2, 1, 4, 5, 0, 6], [4, 6, 8, 5, 8, 8], [5, 4, 6] ] #終了 (n%4 == 1) rep2 = [ [0, 1, 2], [2, 3, 3, 0, 1, 3], [1, 4, 4, 0, 4, 2] ] #終了 (n%4 == 2) rep3 = [ [0, 1, 2], [0, 3, 1, 4, 2, 5], [0, 3, 1, 4, 2, 5], [3, 4, 5, 6, 6, 6] ] #終了 (n%4 == 0) rep4 = [ [2, 0, 4], [0, 1, 1, 2, 1, 4], [0, 2, 3, 4, 5, 7], [3, 5, 6, 7, 0, 8], [3, 5, 6, 7, 0, 8], [6, 8, 9, 9, 0, 9] ] if n == 1: print("1\n0\n0\n0\n1\n1") elif n == 2: print("-1") elif n == 3: print("012\n345\n345\n225\n141\n300") elif n == 4: print("4551\n3662\n6777\n3005\n3442\n0112") elif n == 5: print("79142\n80653\n80453\n90966\n87754\n11223") elif n == 6: print("022586\n133097\n166600\n244397\n455898\n100667") elif n % 4 == 3: a = [[] for i in range(n)] a[0] = tenple[0] a[1] = tenple[1] a[2] = tenple[2] now = 5 piv = 2 while piv < n - 1: for j in range(5): for l in rep[j]: a[piv+j].append((l+now)%10) now += 9 piv += 4 a[n-1].append(now%10) a[n-1].append(now%10) a[n-1].append(now%10) r = ["".join([str(a[i][j]) for i in range(n)]) for j in range(6)] print(*r,sep="\n") elif n % 4 == 1: a = [[] for i in range(n)] a[0] = tenple[0] a[1] = tenple[1] a[2] = tenple[2] now = 5 piv = 2 while piv < n - 3: for j in range(5): for l in rep[j]: a[piv+j].append((l+now)%10) now += 9 piv += 4 for j in range(3): for l in rep2[j]: a[piv+j].append((l+now)%10) r = ["".join([str(a[i][j]) for i in range(n)]) for j in range(6)] print(*r,sep="\n") elif n % 4 == 2: a = [[] for i in range(n)] a[0] = tenple[0] a[1] = tenple[1] a[2] = tenple[2] now = 5 piv = 2 while piv < n - 4: for j in range(5): for l in rep[j]: a[piv+j].append((l+now)%10) now += 9 piv += 4 for j in range(4): for l in rep3[j]: a[piv+j].append((l+now)%10) r = ["".join([str(a[i][j]) for i in range(n)]) for j in range(6)] print(*r,sep="\n") elif n % 4 == 0: a = [[] for i in range(n)] a[0] = tenple[0] a[1] = tenple[1] a[2] = tenple[2] now = 5 piv = 2 while piv < n - 9: for j in range(5): for l in rep[j]: a[piv+j].append((l+now)%10) now += 9 piv += 4 for j in range(6): for l in rep4[j]: a[piv+j].append((l+now)%10) r = ["".join([str(a[i][j]) for i in range(n)]) for j in range(6)] print(*r,sep="\n")