Finding inverse

a, m = [int(x) for x in input().split()]


def gcd(a, b):
    if (b == 0): return (a, 1, 0)
    g, x1, y1  = gcd(b, a%b)
    x = y1
    y = x1 - (a//b) * y1
    return (g, x, y)

g, x, _ = gcd(a, m)
if g != 1: print(-1)
else:
    inv = x % m
    if inv == 0: print(-1)
    else: print(inv)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED