結果
問題 | No.446 ゆきこーだーの雨と雪 (1) |
ユーザー | McGregorsh |
提出日時 | 2023-04-11 11:17:30 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,658 bytes |
コンパイル時間 | 187 ms |
コンパイル使用メモリ | 82,432 KB |
実行使用メモリ | 90,112 KB |
最終ジャッジ日時 | 2024-04-16 10:24:15 |
合計ジャッジ時間 | 3,797 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 158 ms
89,728 KB |
testcase_01 | AC | 157 ms
89,600 KB |
testcase_02 | AC | 159 ms
89,600 KB |
testcase_03 | AC | 157 ms
89,728 KB |
testcase_04 | AC | 159 ms
89,600 KB |
testcase_05 | AC | 158 ms
89,708 KB |
testcase_06 | AC | 160 ms
89,720 KB |
testcase_07 | WA | - |
testcase_08 | AC | 160 ms
89,728 KB |
testcase_09 | WA | - |
testcase_10 | AC | 156 ms
89,216 KB |
testcase_11 | AC | 156 ms
89,720 KB |
testcase_12 | AC | 153 ms
89,628 KB |
testcase_13 | AC | 157 ms
89,216 KB |
testcase_14 | AC | 158 ms
89,368 KB |
testcase_15 | AC | 156 ms
89,600 KB |
testcase_16 | AC | 157 ms
89,512 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 = input() B = input() nums = '1234567890' for i in A: if i not in nums: print('NG') exit() for i in B: if i not in nums: print('NG') exit() if int(A) > 12345 or int(B) > 12345: print('NG') else: print('OK') if __name__ == '__main__': main()