結果
問題 | No.736 約比 |
ユーザー | McGregorsh |
提出日時 | 2023-04-12 14:41:32 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 135 ms / 2,000 ms |
コード長 | 1,578 bytes |
コンパイル時間 | 202 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 89,856 KB |
最終ジャッジ日時 | 2024-04-17 03:23:40 |
合計ジャッジ時間 | 10,176 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 119 ms
89,692 KB |
testcase_01 | AC | 116 ms
89,856 KB |
testcase_02 | AC | 119 ms
89,612 KB |
testcase_03 | AC | 117 ms
89,600 KB |
testcase_04 | AC | 118 ms
89,676 KB |
testcase_05 | AC | 119 ms
89,600 KB |
testcase_06 | AC | 127 ms
89,536 KB |
testcase_07 | AC | 125 ms
89,304 KB |
testcase_08 | AC | 116 ms
89,764 KB |
testcase_09 | AC | 117 ms
89,728 KB |
testcase_10 | AC | 116 ms
89,676 KB |
testcase_11 | AC | 123 ms
89,372 KB |
testcase_12 | AC | 128 ms
89,748 KB |
testcase_13 | AC | 127 ms
89,600 KB |
testcase_14 | AC | 120 ms
89,284 KB |
testcase_15 | AC | 116 ms
89,364 KB |
testcase_16 | AC | 115 ms
89,616 KB |
testcase_17 | AC | 116 ms
89,588 KB |
testcase_18 | AC | 116 ms
89,416 KB |
testcase_19 | AC | 118 ms
89,344 KB |
testcase_20 | AC | 118 ms
89,532 KB |
testcase_21 | AC | 128 ms
89,560 KB |
testcase_22 | AC | 119 ms
89,408 KB |
testcase_23 | AC | 119 ms
89,600 KB |
testcase_24 | AC | 121 ms
89,604 KB |
testcase_25 | AC | 118 ms
89,600 KB |
testcase_26 | AC | 124 ms
89,576 KB |
testcase_27 | AC | 123 ms
89,600 KB |
testcase_28 | AC | 119 ms
89,696 KB |
testcase_29 | AC | 135 ms
89,368 KB |
testcase_30 | AC | 127 ms
89,584 KB |
testcase_31 | AC | 132 ms
89,300 KB |
testcase_32 | AC | 115 ms
89,372 KB |
testcase_33 | AC | 119 ms
89,388 KB |
testcase_34 | AC | 127 ms
89,604 KB |
testcase_35 | AC | 132 ms
89,728 KB |
testcase_36 | AC | 130 ms
89,520 KB |
testcase_37 | AC | 121 ms
89,600 KB |
testcase_38 | AC | 121 ms
89,300 KB |
testcase_39 | AC | 129 ms
89,600 KB |
testcase_40 | AC | 135 ms
89,716 KB |
testcase_41 | AC | 118 ms
89,844 KB |
testcase_42 | AC | 118 ms
89,296 KB |
testcase_43 | AC | 126 ms
89,600 KB |
testcase_44 | AC | 120 ms
89,688 KB |
testcase_45 | AC | 115 ms
89,728 KB |
testcase_46 | AC | 115 ms
89,584 KB |
testcase_47 | AC | 122 ms
89,736 KB |
testcase_48 | AC | 124 ms
89,712 KB |
testcase_49 | AC | 117 ms
89,344 KB |
testcase_50 | AC | 130 ms
89,592 KB |
testcase_51 | AC | 125 ms
89,600 KB |
testcase_52 | AC | 129 ms
89,172 KB |
testcase_53 | AC | 126 ms
89,728 KB |
testcase_54 | AC | 124 ms
89,616 KB |
testcase_55 | AC | 117 ms
89,656 KB |
testcase_56 | AC | 119 ms
89,616 KB |
testcase_57 | AC | 122 ms
89,728 KB |
testcase_58 | AC | 129 ms
89,824 KB |
testcase_59 | AC | 122 ms
89,704 KB |
testcase_60 | AC | 117 ms
89,316 KB |
testcase_61 | AC | 115 ms
89,600 KB |
testcase_62 | AC | 120 ms
89,364 KB |
testcase_63 | AC | 128 ms
89,600 KB |
testcase_64 | AC | 129 ms
89,280 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): N = int(input()) A = i_list() now = gcd(A[0], A[1]) for i in range(2, N): now = gcd(now, A[i]) ans = '' for i in range(N): p = A[i] // now ans += str(p) + ':' print(ans[:-1]) if __name__ == '__main__': main()