結果
問題 | No.1223 I hate Golf |
ユーザー | McGregorsh |
提出日時 | 2023-05-04 13:00:17 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 246 ms / 2,000 ms |
コード長 | 1,446 bytes |
コンパイル時間 | 1,019 ms |
コンパイル使用メモリ | 86,868 KB |
実行使用メモリ | 92,412 KB |
最終ジャッジ日時 | 2023-08-14 10:15:54 |
合計ジャッジ時間 | 5,302 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 246 ms
92,232 KB |
testcase_01 | AC | 246 ms
92,412 KB |
testcase_02 | AC | 240 ms
92,280 KB |
testcase_03 | AC | 237 ms
92,172 KB |
testcase_04 | AC | 237 ms
92,088 KB |
testcase_05 | AC | 240 ms
92,360 KB |
testcase_06 | AC | 242 ms
92,264 KB |
testcase_07 | AC | 241 ms
92,284 KB |
testcase_08 | AC | 240 ms
92,396 KB |
testcase_09 | AC | 240 ms
92,196 KB |
testcase_10 | AC | 241 ms
92,268 KB |
testcase_11 | AC | 240 ms
92,356 KB |
testcase_12 | AC | 242 ms
92,316 KB |
testcase_13 | AC | 242 ms
92,344 KB |
testcase_14 | AC | 241 ms
92,368 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(): N, K, T = i_map() if T * K >= abs(N): print('Yes') else: print('No') if __name__ == '__main__': main()