結果
問題 | No.1632 Sorting Integers (GCD of M) |
ユーザー | mkawa2 |
提出日時 | 2021-07-30 22:03:18 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,136 bytes |
コンパイル時間 | 737 ms |
コンパイル使用メモリ | 87,104 KB |
実行使用メモリ | 71,632 KB |
最終ジャッジ日時 | 2023-10-14 04:51:37 |
合計ジャッジ時間 | 7,873 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 79 ms
71,556 KB |
testcase_01 | AC | 79 ms
71,460 KB |
testcase_02 | AC | 76 ms
71,496 KB |
testcase_03 | AC | 76 ms
71,072 KB |
testcase_04 | AC | 76 ms
71,228 KB |
testcase_05 | AC | 77 ms
71,088 KB |
testcase_06 | AC | 76 ms
71,076 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 77 ms
71,052 KB |
testcase_11 | AC | 75 ms
71,408 KB |
testcase_12 | AC | 77 ms
71,528 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 78 ms
71,144 KB |
testcase_17 | AC | 79 ms
71,448 KB |
testcase_18 | AC | 79 ms
71,144 KB |
testcase_19 | WA | - |
testcase_20 | AC | 79 ms
71,400 KB |
testcase_21 | WA | - |
testcase_22 | AC | 77 ms
71,372 KB |
testcase_23 | AC | 78 ms
71,292 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | AC | 76 ms
71,360 KB |
testcase_27 | AC | 77 ms
71,076 KB |
testcase_28 | AC | 77 ms
71,552 KB |
testcase_29 | AC | 78 ms
71,280 KB |
testcase_30 | AC | 78 ms
71,548 KB |
testcase_31 | AC | 78 ms
71,056 KB |
testcase_32 | AC | 77 ms
70,980 KB |
testcase_33 | AC | 79 ms
71,300 KB |
testcase_34 | WA | - |
testcase_35 | AC | 78 ms
71,284 KB |
testcase_36 | AC | 77 ms
71,284 KB |
testcase_37 | AC | 77 ms
71,208 KB |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | AC | 78 ms
71,204 KB |
testcase_41 | AC | 78 ms
71,204 KB |
testcase_42 | AC | 79 ms
71,228 KB |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | AC | 75 ms
71,108 KB |
testcase_47 | AC | 77 ms
71,452 KB |
testcase_48 | AC | 77 ms
71,392 KB |
testcase_49 | AC | 76 ms
71,388 KB |
testcase_50 | AC | 75 ms
71,376 KB |
testcase_51 | AC | 79 ms
71,392 KB |
testcase_52 | AC | 77 ms
71,112 KB |
testcase_53 | AC | 77 ms
70,972 KB |
testcase_54 | AC | 76 ms
71,432 KB |
testcase_55 | AC | 78 ms
71,400 KB |
testcase_56 | AC | 78 ms
71,440 KB |
testcase_57 | AC | 77 ms
71,292 KB |
testcase_58 | AC | 78 ms
71,468 KB |
testcase_59 | WA | - |
testcase_60 | WA | - |
testcase_61 | WA | - |
testcase_62 | WA | - |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = 10**16 # md = 998244353 md = 10**9+7 from itertools import permutations from math import gcd n = II() ac = LI() if n < 8: aa = [] for a, c in enumerate(ac, 1): aa += [str(a)]*c ans = 0 for dd in permutations(aa): cur = int("".join(dd)) ans = gcd(ans, cur) print(ans) exit() aa, cc = [], [] for a, c in enumerate(ac, 1): if c: aa.append(a) cc.append(c) g = 0 for a in aa: g = gcd(g, a) s = 0 for a, c in zip(aa, cc): s += a*c if s%9 == 0: g *= 9 elif s%3 == 0: g *= 3 print(g)