結果
問題 | No.2194 兄弟の掛け引き |
ユーザー | McGregorsh |
提出日時 | 2023-01-22 22:17:49 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,633 bytes |
コンパイル時間 | 1,240 ms |
コンパイル使用メモリ | 87,336 KB |
実行使用メモリ | 92,992 KB |
最終ジャッジ日時 | 2023-09-07 06:01:57 |
合計ジャッジ時間 | 7,014 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 254 ms
92,804 KB |
testcase_01 | AC | 247 ms
92,992 KB |
testcase_02 | AC | 248 ms
92,692 KB |
testcase_03 | AC | 249 ms
92,756 KB |
testcase_04 | AC | 248 ms
92,848 KB |
testcase_05 | AC | 244 ms
92,728 KB |
testcase_06 | AC | 250 ms
92,908 KB |
testcase_07 | AC | 247 ms
92,708 KB |
testcase_08 | AC | 246 ms
92,956 KB |
testcase_09 | AC | 249 ms
92,780 KB |
testcase_10 | AC | 249 ms
92,716 KB |
testcase_11 | AC | 246 ms
92,812 KB |
testcase_12 | AC | 246 ms
92,820 KB |
testcase_13 | AC | 251 ms
92,844 KB |
testcase_14 | WA | - |
testcase_15 | AC | 251 ms
92,920 KB |
testcase_16 | AC | 248 ms
92,764 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, B, C = i_map() ans = [] for i in range(200000): if i * A - B > 0: score = i * A - B else: score = i * A if score == C: ans.append(i) if len(ans) == 0: print(-1) else: for i in ans: print(i) if __name__ == '__main__': main()