結果
問題 | No.2022 Antilogarithm |
ユーザー | McGregorsh |
提出日時 | 2023-05-24 21:32:21 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,535 bytes |
コンパイル時間 | 368 ms |
コンパイル使用メモリ | 81,876 KB |
実行使用メモリ | 89,852 KB |
最終ジャッジ日時 | 2024-06-06 08:11:02 |
合計ジャッジ時間 | 10,437 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 122 ms
89,096 KB |
testcase_01 | AC | 123 ms
89,688 KB |
testcase_02 | AC | 123 ms
89,728 KB |
testcase_03 | AC | 120 ms
89,700 KB |
testcase_04 | AC | 119 ms
89,364 KB |
testcase_05 | AC | 124 ms
89,800 KB |
testcase_06 | AC | 123 ms
89,380 KB |
testcase_07 | AC | 119 ms
89,716 KB |
testcase_08 | AC | 122 ms
89,484 KB |
testcase_09 | AC | 121 ms
89,728 KB |
testcase_10 | AC | 121 ms
89,568 KB |
testcase_11 | AC | 119 ms
89,544 KB |
testcase_12 | AC | 125 ms
89,344 KB |
testcase_13 | AC | 123 ms
89,200 KB |
testcase_14 | AC | 126 ms
89,604 KB |
testcase_15 | AC | 123 ms
89,644 KB |
testcase_16 | AC | 122 ms
89,592 KB |
testcase_17 | AC | 119 ms
89,404 KB |
testcase_18 | AC | 121 ms
89,612 KB |
testcase_19 | AC | 123 ms
89,524 KB |
testcase_20 | AC | 124 ms
89,728 KB |
testcase_21 | AC | 121 ms
89,532 KB |
testcase_22 | AC | 121 ms
89,384 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 120 ms
89,712 KB |
testcase_26 | WA | - |
testcase_27 | AC | 162 ms
89,180 KB |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | AC | 124 ms
89,652 KB |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 129 ms
89,728 KB |
testcase_35 | WA | - |
testcase_36 | AC | 123 ms
89,704 KB |
testcase_37 | AC | 122 ms
89,508 KB |
testcase_38 | AC | 122 ms
89,728 KB |
testcase_39 | AC | 124 ms
89,432 KB |
testcase_40 | AC | 127 ms
89,344 KB |
testcase_41 | AC | 125 ms
89,732 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 | 133 ms
89,428 KB |
testcase_56 | AC | 139 ms
89,368 KB |
testcase_57 | AC | 139 ms
89,728 KB |
testcase_58 | AC | 127 ms
89,280 KB |
testcase_59 | AC | 129 ms
89,604 KB |
testcase_60 | AC | 127 ms
89,660 KB |
testcase_61 | AC | 129 ms
89,596 KB |
testcase_62 | AC | 121 ms
89,608 KB |
testcase_63 | AC | 121 ms
89,612 KB |
testcase_64 | AC | 127 ms
89,632 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()