結果
問題 | No.2014 Eggs Hatching |
ユーザー | McGregorsh |
提出日時 | 2022-07-22 21:20:52 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 251 ms / 2,000 ms |
コード長 | 1,397 bytes |
コンパイル時間 | 288 ms |
コンパイル使用メモリ | 87,312 KB |
実行使用メモリ | 92,596 KB |
最終ジャッジ日時 | 2023-09-18 22:05:48 |
合計ジャッジ時間 | 6,552 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 249 ms
92,440 KB |
testcase_01 | AC | 245 ms
92,332 KB |
testcase_02 | AC | 243 ms
92,428 KB |
testcase_03 | AC | 245 ms
92,524 KB |
testcase_04 | AC | 246 ms
92,596 KB |
testcase_05 | AC | 245 ms
92,460 KB |
testcase_06 | AC | 245 ms
92,460 KB |
testcase_07 | AC | 243 ms
92,476 KB |
testcase_08 | AC | 244 ms
92,528 KB |
testcase_09 | AC | 248 ms
92,452 KB |
testcase_10 | AC | 245 ms
92,456 KB |
testcase_11 | AC | 244 ms
92,536 KB |
testcase_12 | AC | 245 ms
92,560 KB |
testcase_13 | AC | 245 ms
92,476 KB |
testcase_14 | AC | 248 ms
92,500 KB |
testcase_15 | AC | 251 ms
92,460 KB |
testcase_16 | AC | 247 ms
92,520 KB |
testcase_17 | AC | 251 ms
92,492 KB |
testcase_18 | AC | 247 ms
92,436 KB |
testcase_19 | AC | 245 ms
92,480 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 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 = i_list() print(min(a)) if __name__ == '__main__': main()