結果
問題 | No.1799 Summer Day |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 16:17:26 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 254 ms / 2,000 ms |
コード長 | 1,555 bytes |
コンパイル時間 | 314 ms |
コンパイル使用メモリ | 87,096 KB |
実行使用メモリ | 92,644 KB |
最終ジャッジ日時 | 2023-08-17 21:05:19 |
合計ジャッジ時間 | 7,973 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 244 ms
92,544 KB |
testcase_01 | AC | 244 ms
92,376 KB |
testcase_02 | AC | 254 ms
92,488 KB |
testcase_03 | AC | 250 ms
92,604 KB |
testcase_04 | AC | 241 ms
92,456 KB |
testcase_05 | AC | 246 ms
92,384 KB |
testcase_06 | AC | 249 ms
92,616 KB |
testcase_07 | AC | 251 ms
92,456 KB |
testcase_08 | AC | 239 ms
92,308 KB |
testcase_09 | AC | 241 ms
92,504 KB |
testcase_10 | AC | 246 ms
92,496 KB |
testcase_11 | AC | 245 ms
92,312 KB |
testcase_12 | AC | 247 ms
92,344 KB |
testcase_13 | AC | 252 ms
92,644 KB |
testcase_14 | AC | 250 ms
92,324 KB |
testcase_15 | AC | 249 ms
92,512 KB |
testcase_16 | AC | 247 ms
92,504 KB |
testcase_17 | AC | 250 ms
92,264 KB |
testcase_18 | AC | 253 ms
92,484 KB |
testcase_19 | AC | 254 ms
92,328 KB |
testcase_20 | AC | 250 ms
92,544 KB |
testcase_21 | AC | 242 ms
92,328 KB |
testcase_22 | AC | 252 ms
92,492 KB |
testcase_23 | AC | 241 ms
92,328 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, S = i_map() if S < 25: print('No') exit() if S % 29 == 0: p = S // 29 else: p = S // 29 + 1 if p <= N: print('Yes') else: print('No') if __name__ == '__main__': main()