結果
問題 | No.1224 I hate Sqrt Inequality |
ユーザー | McGregorsh |
提出日時 | 2023-05-08 23:56:32 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 242 ms / 2,000 ms |
コード長 | 1,531 bytes |
コンパイル時間 | 280 ms |
コンパイル使用メモリ | 86,872 KB |
実行使用メモリ | 92,372 KB |
最終ジャッジ日時 | 2023-08-16 22:13:01 |
合計ジャッジ時間 | 5,433 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 238 ms
92,084 KB |
testcase_01 | AC | 242 ms
92,244 KB |
testcase_02 | AC | 238 ms
92,312 KB |
testcase_03 | AC | 237 ms
92,216 KB |
testcase_04 | AC | 234 ms
92,160 KB |
testcase_05 | AC | 238 ms
92,372 KB |
testcase_06 | AC | 235 ms
92,256 KB |
testcase_07 | AC | 238 ms
92,152 KB |
testcase_08 | AC | 235 ms
92,148 KB |
testcase_09 | AC | 237 ms
92,312 KB |
testcase_10 | AC | 236 ms
92,052 KB |
testcase_11 | AC | 237 ms
92,072 KB |
testcase_12 | AC | 236 ms
92,256 KB |
testcase_13 | AC | 241 ms
92,208 KB |
testcase_14 | AC | 236 ms
92,148 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd 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(): a, b = i_map() a *= (10 ** 18) for i in range(100): c = a // b * b a -= c a *= 10 if a == 0: print('No') exit() print('Yes') if __name__ == '__main__': main()