← Back to List

29576번: Карта ↗

Solutions

Python 3
901 B | 901 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta

SYS_INPUT = True
RECURSION_LIMIT = 10 ** 7
SET_RECURSION = False
BLANK = " "

if SET_RECURSION:
    sys.setrecursionlimit(RECURSION_LIMIT)

inp = lambda : sys.stdin.readline().rstrip() if SYS_INPUT else input()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
isplit = lambda : inp().split()
p = print

def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)

def solve():
    n, k = mii()

    z = k - 1

    target = n - 1

    if z == 0:
        p(-1 if n > 1 else 0)
        return

    if target % z == 0:
        p(target // z)
    else:
        p(-1)

if __name__ == "__main__":
    tc = 1
    for t in range(1, tc+1):
        ret = solve()