結果
問題 | No.1042 愚直大学 |
ユーザー | McGregorsh |
提出日時 | 2023-05-17 23:08:04 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,567 bytes |
コンパイル時間 | 281 ms |
コンパイル使用メモリ | 82,500 KB |
実行使用メモリ | 90,276 KB |
最終ジャッジ日時 | 2024-05-09 06:38:25 |
合計ジャッジ時間 | 4,554 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 131 ms
89,776 KB |
testcase_01 | AC | 130 ms
89,840 KB |
testcase_02 | AC | 133 ms
89,896 KB |
testcase_03 | AC | 133 ms
89,896 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 132 ms
89,756 KB |
testcase_07 | AC | 132 ms
89,884 KB |
testcase_08 | AC | 130 ms
90,000 KB |
testcase_09 | AC | 133 ms
89,476 KB |
testcase_10 | AC | 135 ms
89,432 KB |
testcase_11 | AC | 139 ms
89,416 KB |
testcase_12 | AC | 139 ms
89,900 KB |
testcase_13 | AC | 130 ms
89,840 KB |
testcase_14 | AC | 134 ms
89,920 KB |
testcase_15 | AC | 132 ms
89,996 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 133 ms
89,696 KB |
testcase_23 | AC | 136 ms
89,432 KB |
testcase_24 | AC | 137 ms
89,880 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 ** 9 under = 0 while top - under > 0.000001: 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()