結果
問題 | No.2022 Antilogarithm |
ユーザー |
|
提出日時 | 2023-05-24 21:32:21 |
言語 | PyPy3 (7.3.11) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,535 bytes |
コンパイル時間 | 345 ms |
コンパイル使用メモリ | 86,960 KB |
実行使用メモリ | 92,776 KB |
最終ジャッジ日時 | 2023-08-25 13:38:46 |
合計ジャッジ時間 | 19,819 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 236 ms
92,716 KB |
testcase_01 | AC | 230 ms
92,592 KB |
testcase_02 | AC | 232 ms
92,568 KB |
testcase_03 | AC | 230 ms
92,524 KB |
testcase_04 | AC | 234 ms
92,484 KB |
testcase_05 | AC | 233 ms
92,524 KB |
testcase_06 | AC | 231 ms
92,540 KB |
testcase_07 | AC | 235 ms
92,776 KB |
testcase_08 | AC | 235 ms
92,608 KB |
testcase_09 | AC | 234 ms
92,516 KB |
testcase_10 | AC | 234 ms
92,660 KB |
testcase_11 | AC | 234 ms
92,448 KB |
testcase_12 | AC | 237 ms
92,516 KB |
testcase_13 | AC | 241 ms
92,516 KB |
testcase_14 | AC | 239 ms
92,512 KB |
testcase_15 | AC | 241 ms
92,540 KB |
testcase_16 | AC | 242 ms
92,556 KB |
testcase_17 | AC | 232 ms
92,512 KB |
testcase_18 | AC | 231 ms
92,280 KB |
testcase_19 | AC | 237 ms
92,588 KB |
testcase_20 | AC | 233 ms
92,612 KB |
testcase_21 | AC | 232 ms
92,552 KB |
testcase_22 | AC | 229 ms
92,688 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 232 ms
92,548 KB |
testcase_26 | WA | - |
testcase_27 | AC | 231 ms
92,284 KB |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | AC | 238 ms
92,536 KB |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 237 ms
92,528 KB |
testcase_35 | WA | - |
testcase_36 | AC | 232 ms
92,540 KB |
testcase_37 | AC | 233 ms
92,288 KB |
testcase_38 | AC | 233 ms
92,540 KB |
testcase_39 | AC | 233 ms
92,556 KB |
testcase_40 | AC | 233 ms
92,308 KB |
testcase_41 | AC | 232 ms
92,536 KB |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | AC | 232 ms
92,536 KB |
testcase_56 | AC | 233 ms
92,548 KB |
testcase_57 | AC | 233 ms
92,548 KB |
testcase_58 | AC | 235 ms
92,748 KB |
testcase_59 | AC | 234 ms
92,644 KB |
testcase_60 | AC | 236 ms
92,508 KB |
testcase_61 | AC | 233 ms
92,484 KB |
testcase_62 | AC | 233 ms
92,684 KB |
testcase_63 | AC | 234 ms
92,548 KB |
testcase_64 | AC | 235 ms
92,520 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, lru_cache 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 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' #input = sys.stdin.readline def main(): A, B = i_map() if 2 * math.log2(A) < math.log2(B**2): print('Yes') else: print('No') if __name__ == '__main__': main()