結果
問題 | No.1350 2019-6problem |
ユーザー | McGregorsh |
提出日時 | 2022-07-16 12:58:45 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 245 ms / 2,000 ms |
コード長 | 1,778 bytes |
コンパイル時間 | 1,143 ms |
コンパイル使用メモリ | 86,668 KB |
実行使用メモリ | 92,556 KB |
最終ジャッジ日時 | 2023-09-10 21:16:38 |
合計ジャッジ時間 | 8,135 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 243 ms
92,272 KB |
testcase_01 | AC | 239 ms
92,364 KB |
testcase_02 | AC | 241 ms
92,368 KB |
testcase_03 | AC | 237 ms
92,360 KB |
testcase_04 | AC | 237 ms
92,272 KB |
testcase_05 | AC | 238 ms
92,268 KB |
testcase_06 | AC | 237 ms
92,408 KB |
testcase_07 | AC | 241 ms
92,152 KB |
testcase_08 | AC | 242 ms
92,324 KB |
testcase_09 | AC | 237 ms
92,424 KB |
testcase_10 | AC | 240 ms
92,556 KB |
testcase_11 | AC | 238 ms
92,356 KB |
testcase_12 | AC | 240 ms
92,068 KB |
testcase_13 | AC | 240 ms
92,272 KB |
testcase_14 | AC | 241 ms
92,552 KB |
testcase_15 | AC | 237 ms
92,320 KB |
testcase_16 | AC | 237 ms
92,344 KB |
testcase_17 | AC | 234 ms
92,388 KB |
testcase_18 | AC | 245 ms
92,288 KB |
testcase_19 | AC | 238 ms
92,148 KB |
testcase_20 | AC | 244 ms
92,384 KB |
testcase_21 | AC | 239 ms
92,360 KB |
testcase_22 | AC | 238 ms
92,472 KB |
testcase_23 | AC | 240 ms
92,268 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 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(): a, b, k = i_map() lcm_ab = lcm(a, b) top = 10 ** 20 under = 0 while top - under > 1: mid = (top + under) // 2 num_a = mid // a num_b = mid // b num_c = mid // lcm_ab score = num_a + num_b - num_c #print(score, mid) if score >= k: top = mid else: under = mid #print(top, under) print(top) if __name__ == '__main__': main()