結果
問題 | No.779 Heisei |
ユーザー | McGregorsh |
提出日時 | 2023-04-10 11:47:25 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 170 ms / 1,000 ms |
コード長 | 1,686 bytes |
コンパイル時間 | 653 ms |
コンパイル使用メモリ | 82,520 KB |
実行使用メモリ | 89,644 KB |
最終ジャッジ日時 | 2024-04-15 18:04:05 |
合計ジャッジ時間 | 5,238 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 161 ms
89,224 KB |
testcase_01 | AC | 160 ms
89,528 KB |
testcase_02 | AC | 163 ms
89,608 KB |
testcase_03 | AC | 164 ms
89,580 KB |
testcase_04 | AC | 160 ms
89,584 KB |
testcase_05 | AC | 166 ms
89,456 KB |
testcase_06 | AC | 158 ms
89,644 KB |
testcase_07 | AC | 163 ms
89,304 KB |
testcase_08 | AC | 164 ms
89,508 KB |
testcase_09 | AC | 170 ms
89,040 KB |
testcase_10 | AC | 158 ms
89,356 KB |
testcase_11 | AC | 167 ms
89,564 KB |
testcase_12 | AC | 157 ms
89,440 KB |
testcase_13 | AC | 164 ms
89,328 KB |
testcase_14 | AC | 162 ms
89,392 KB |
testcase_15 | AC | 160 ms
89,572 KB |
testcase_16 | AC | 157 ms
89,644 KB |
testcase_17 | AC | 157 ms
89,400 KB |
testcase_18 | AC | 160 ms
89,368 KB |
testcase_19 | AC | 162 ms
89,272 KB |
testcase_20 | AC | 156 ms
89,636 KB |
testcase_21 | AC | 159 ms
89,356 KB |
testcase_22 | AC | 161 ms
89,316 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(): Y, M, D = i_map() if Y < 1989 or Y > 2019: print('No') exit() if Y == 1989: if M == 1 and D <= 7: print('No') exit() if Y == 2019: if M == 4 and D <= 30: print('Yes') exit() elif M > 4: print('No') exit() print('Yes') if __name__ == '__main__': main()