結果
問題 | No.1042 愚直大学 |
ユーザー | McGregorsh |
提出日時 | 2023-05-17 23:09:16 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,568 bytes |
コンパイル時間 | 377 ms |
コンパイル使用メモリ | 87,416 KB |
実行使用メモリ | 93,136 KB |
最終ジャッジ日時 | 2023-08-22 00:40:44 |
合計ジャッジ時間 | 7,233 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 229 ms
92,960 KB |
testcase_01 | AC | 227 ms
92,764 KB |
testcase_02 | AC | 223 ms
92,788 KB |
testcase_03 | AC | 223 ms
92,812 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 224 ms
92,816 KB |
testcase_07 | AC | 227 ms
92,980 KB |
testcase_08 | AC | 221 ms
92,860 KB |
testcase_09 | AC | 222 ms
92,920 KB |
testcase_10 | AC | 221 ms
92,904 KB |
testcase_11 | AC | 220 ms
92,868 KB |
testcase_12 | AC | 221 ms
92,872 KB |
testcase_13 | AC | 223 ms
92,772 KB |
testcase_14 | AC | 220 ms
92,804 KB |
testcase_15 | AC | 238 ms
92,936 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 223 ms
92,656 KB |
testcase_19 | WA | - |
testcase_20 | AC | 222 ms
92,676 KB |
testcase_21 | AC | 223 ms
92,776 KB |
testcase_22 | AC | 225 ms
92,640 KB |
testcase_23 | AC | 222 ms
92,676 KB |
testcase_24 | AC | 219 ms
92,672 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 ** 10 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()