結果
問題 | No.751 Frac #2 |
ユーザー | McGregorsh |
提出日時 | 2022-07-03 09:23:24 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,674 bytes |
コンパイル時間 | 273 ms |
コンパイル使用メモリ | 86,720 KB |
実行使用メモリ | 92,908 KB |
最終ジャッジ日時 | 2023-08-19 07:49:27 |
合計ジャッジ時間 | 9,577 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 187 ms
92,848 KB |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | AC | 188 ms
92,676 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 186 ms
92,592 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 191 ms
92,616 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 186 ms
92,760 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | AC | 187 ms
92,808 KB |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
ソースコード
import sys, re 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 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(): n1 = int(input()) A = i_list() n2 = int(input()) B = i_list() A_bunsi = A[0] A_bunbo = 1 for i in range(1, n1): A_bunbo *= A[i] B_bunsi = B[0] B_bunbo = 1 for i in range(1, n2): B_bunbo *= B[i] new_a = A_bunsi * B_bunbo new_b = B_bunsi * A_bunbo num = gcd(new_a, new_b) print(new_a//num , new_b//num) if __name__ == '__main__': main()