結果
問題 | No.982 Add |
ユーザー | McGregorsh |
提出日時 | 2023-05-17 22:05:19 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,616 bytes |
コンパイル時間 | 513 ms |
コンパイル使用メモリ | 87,280 KB |
実行使用メモリ | 93,740 KB |
最終ジャッジ日時 | 2023-08-22 00:00:08 |
合計ジャッジ時間 | 10,933 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 546 ms
93,740 KB |
testcase_01 | AC | 234 ms
92,404 KB |
testcase_02 | AC | 306 ms
93,444 KB |
testcase_03 | AC | 306 ms
93,280 KB |
testcase_04 | AC | 240 ms
92,736 KB |
testcase_05 | AC | 311 ms
93,272 KB |
testcase_06 | AC | 308 ms
93,452 KB |
testcase_07 | AC | 308 ms
93,684 KB |
testcase_08 | AC | 317 ms
93,576 KB |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | AC | 312 ms
93,688 KB |
testcase_12 | AC | 311 ms
93,568 KB |
testcase_13 | AC | 312 ms
93,556 KB |
testcase_14 | AC | 605 ms
93,468 KB |
testcase_15 | AC | 311 ms
93,452 KB |
testcase_16 | AC | 304 ms
93,656 KB |
testcase_17 | AC | 306 ms
93,560 KB |
testcase_18 | AC | 235 ms
92,684 KB |
testcase_19 | AC | 236 ms
92,492 KB |
testcase_20 | AC | 235 ms
92,684 KB |
testcase_21 | AC | 232 ms
92,420 KB |
testcase_22 | AC | 238 ms
92,408 KB |
testcase_23 | AC | 238 ms
92,596 KB |
testcase_24 | WA | - |
testcase_25 | WA | - |
ソースコード
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 = i_map() if gcd(A, B) == 1: ans = [False] * 5000 for i in range(5100): for j in range(5100): p = i * A + B * j if p < 5000: ans[p] = True print(5000 - sum(ans)) else: print(-1) if __name__ == '__main__': main()