結果
問題 | No.201 yukicoderじゃんけん |
ユーザー | McGregorsh |
提出日時 | 2023-03-25 12:27:48 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,497 bytes |
コンパイル時間 | 927 ms |
コンパイル使用メモリ | 81,828 KB |
実行使用メモリ | 88,660 KB |
最終ジャッジ日時 | 2023-10-18 23:38:02 |
合計ジャッジ時間 | 4,567 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 141 ms
88,496 KB |
testcase_01 | AC | 141 ms
88,400 KB |
testcase_02 | AC | 141 ms
88,492 KB |
testcase_03 | AC | 143 ms
88,408 KB |
testcase_04 | AC | 143 ms
88,476 KB |
testcase_05 | AC | 142 ms
88,500 KB |
testcase_06 | AC | 142 ms
88,500 KB |
testcase_07 | AC | 140 ms
88,492 KB |
testcase_08 | AC | 139 ms
88,476 KB |
testcase_09 | AC | 141 ms
88,500 KB |
testcase_10 | AC | 157 ms
88,496 KB |
testcase_11 | AC | 143 ms
88,408 KB |
testcase_12 | AC | 144 ms
88,496 KB |
testcase_13 | AC | 143 ms
88,500 KB |
testcase_14 | AC | 144 ms
88,500 KB |
testcase_15 | RE | - |
testcase_16 | RE | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | RE | - |
ソースコード
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, b, c = s_map() d, e, f = s_map() if int(b) > int(e): print(a) elif int(b) == int(e): print(-1) else: print(d) if __name__ == '__main__': main()