結果
問題 | No.415 ぴょん |
ユーザー | McGregorsh |
提出日時 | 2023-05-16 14:19:00 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 237 ms / 1,000 ms |
コード長 | 1,447 bytes |
コンパイル時間 | 292 ms |
コンパイル使用メモリ | 87,144 KB |
実行使用メモリ | 92,732 KB |
最終ジャッジ日時 | 2023-08-21 05:43:52 |
合計ジャッジ時間 | 8,470 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 234 ms
92,544 KB |
testcase_01 | AC | 235 ms
92,632 KB |
testcase_02 | AC | 237 ms
92,732 KB |
testcase_03 | AC | 235 ms
92,388 KB |
testcase_04 | AC | 235 ms
92,396 KB |
testcase_05 | AC | 236 ms
92,588 KB |
testcase_06 | AC | 236 ms
92,392 KB |
testcase_07 | AC | 237 ms
92,612 KB |
testcase_08 | AC | 235 ms
92,480 KB |
testcase_09 | AC | 234 ms
92,592 KB |
testcase_10 | AC | 234 ms
92,396 KB |
testcase_11 | AC | 231 ms
92,308 KB |
testcase_12 | AC | 230 ms
92,592 KB |
testcase_13 | AC | 233 ms
92,476 KB |
testcase_14 | AC | 229 ms
92,536 KB |
testcase_15 | AC | 231 ms
92,596 KB |
testcase_16 | AC | 229 ms
92,600 KB |
testcase_17 | AC | 231 ms
92,588 KB |
testcase_18 | AC | 235 ms
92,588 KB |
testcase_19 | AC | 229 ms
92,348 KB |
testcase_20 | AC | 227 ms
92,528 KB |
testcase_21 | AC | 227 ms
92,620 KB |
testcase_22 | AC | 230 ms
92,644 KB |
testcase_23 | AC | 233 ms
92,628 KB |
testcase_24 | AC | 223 ms
92,584 KB |
testcase_25 | AC | 229 ms
92,476 KB |
testcase_26 | AC | 232 ms
92,312 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(): N, D = i_map() p = gcd(N, D) if p == 1: print(N-1) else: print(N//p-1) if __name__ == '__main__': main()