結果
問題 | No.1042 愚直大学 |
ユーザー | McGregorsh |
提出日時 | 2023-05-17 23:11:18 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 173 ms / 2,000 ms |
コード長 | 1,567 bytes |
コンパイル時間 | 210 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 90,112 KB |
最終ジャッジ日時 | 2024-05-09 06:41:30 |
合計ジャッジ時間 | 5,906 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 163 ms
89,856 KB |
testcase_01 | AC | 165 ms
89,984 KB |
testcase_02 | AC | 164 ms
89,984 KB |
testcase_03 | AC | 165 ms
89,600 KB |
testcase_04 | AC | 166 ms
89,856 KB |
testcase_05 | AC | 165 ms
89,856 KB |
testcase_06 | AC | 173 ms
89,728 KB |
testcase_07 | AC | 164 ms
89,728 KB |
testcase_08 | AC | 164 ms
89,856 KB |
testcase_09 | AC | 167 ms
89,984 KB |
testcase_10 | AC | 165 ms
89,856 KB |
testcase_11 | AC | 166 ms
90,112 KB |
testcase_12 | AC | 164 ms
89,984 KB |
testcase_13 | AC | 165 ms
89,600 KB |
testcase_14 | AC | 165 ms
89,984 KB |
testcase_15 | AC | 166 ms
90,112 KB |
testcase_16 | AC | 164 ms
89,600 KB |
testcase_17 | AC | 167 ms
89,600 KB |
testcase_18 | AC | 168 ms
89,472 KB |
testcase_19 | AC | 169 ms
89,600 KB |
testcase_20 | AC | 169 ms
89,728 KB |
testcase_21 | AC | 167 ms
89,856 KB |
testcase_22 | AC | 172 ms
89,600 KB |
testcase_23 | AC | 168 ms
89,856 KB |
testcase_24 | AC | 170 ms
89,856 KB |
ソースコード
import sys, re from fractions import Fraction import math 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(): P, Q = i_map() top = 10 ** 12 under = 0 while top - under > 0.00001: mid = (top + under) / 2 A = mid ** 2 B = P + Q * mid * math.log2(mid) if A <= B: under = mid else: top = mid print(under) if __name__ == '__main__': main()