結果
問題 | No.1305 Speak of the Devil |
ユーザー | McGregorsh |
提出日時 | 2022-07-15 13:03:33 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 242 ms / 2,000 ms |
コード長 | 1,434 bytes |
コンパイル時間 | 280 ms |
コンパイル使用メモリ | 87,008 KB |
実行使用メモリ | 92,124 KB |
最終ジャッジ日時 | 2023-09-09 14:33:07 |
合計ジャッジ時間 | 8,362 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 239 ms
92,092 KB |
testcase_01 | AC | 240 ms
92,124 KB |
testcase_02 | AC | 240 ms
92,020 KB |
testcase_03 | AC | 240 ms
92,104 KB |
testcase_04 | AC | 240 ms
92,084 KB |
testcase_05 | AC | 238 ms
92,052 KB |
testcase_06 | AC | 235 ms
92,004 KB |
testcase_07 | AC | 240 ms
92,120 KB |
testcase_08 | AC | 238 ms
91,988 KB |
testcase_09 | AC | 240 ms
91,932 KB |
testcase_10 | AC | 240 ms
91,888 KB |
testcase_11 | AC | 240 ms
92,072 KB |
testcase_12 | AC | 240 ms
91,892 KB |
testcase_13 | AC | 241 ms
92,040 KB |
testcase_14 | AC | 242 ms
92,080 KB |
testcase_15 | AC | 240 ms
92,084 KB |
testcase_16 | AC | 242 ms
92,008 KB |
testcase_17 | AC | 237 ms
91,992 KB |
testcase_18 | AC | 240 ms
92,008 KB |
testcase_19 | AC | 242 ms
92,120 KB |
testcase_20 | AC | 241 ms
91,892 KB |
testcase_21 | AC | 237 ms
91,904 KB |
testcase_22 | AC | 235 ms
92,052 KB |
testcase_23 | AC | 236 ms
91,904 KB |
testcase_24 | AC | 234 ms
92,064 KB |
testcase_25 | AC | 237 ms
91,968 KB |
testcase_26 | AC | 237 ms
91,836 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, b = i_map() if a > b: print(b) else: print(a) if __name__ == '__main__': main()