結果

問題 No.751 Frac #2
ユーザー McGregorshMcGregorsh
提出日時 2023-05-17 10:41:35
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 1,796 bytes
コンパイル時間 305 ms
コンパイル使用メモリ 82,588 KB
実行使用メモリ 90,124 KB
最終ジャッジ日時 2024-05-08 22:07:56
合計ジャッジ時間 7,407 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 150 ms
89,472 KB
testcase_01 AC 151 ms
89,600 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 145 ms
89,472 KB
testcase_08 WA -
testcase_09 AC 147 ms
89,492 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 146 ms
89,600 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 AC 149 ms
89,648 KB
testcase_19 AC 146 ms
89,600 KB
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 WA -
testcase_33 AC 149 ms
89,728 KB
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
権限があれば一括ダウンロードができます

ソースコード

diff #

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():
   
   N1 = int(input())
   A = i_list()
   N2 = int(input())
   B = i_list()
   
   base1 = Fraction(A[0], 1)
   for i in range(1, N1):
   	  base1 = base1 * Fraction(1, A[i])
   
   base2 = Fraction(B[0], 1)
   for i in range(1, N2):
   	  base2 = base2 * Fraction(1, B[i])
   
   a = base1.numerator
   b = base1.denominator
   c = base2.numerator
   d = base2.denominator
   
   e = a * d
   f = b * c
   
   p = gcd(e, f)
   print(e // p, f // p)
   
if __name__ == '__main__':
    main()
    
0