Submission details
Task:Finding inverse
Sender:aalto26kh_010
Submission time:2026-11-17 15:40:23 +0200
Language:Python3 (PyPy3)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.04 sdetails
#2ACCEPTED0.04 sdetails
#3ACCEPTED0.04 sdetails
#4ACCEPTED0.04 sdetails
#5ACCEPTED0.05 sdetails
#6ACCEPTED0.05 sdetails
#7ACCEPTED0.05 sdetails
#8ACCEPTED0.04 sdetails
#9ACCEPTED0.24 sdetails
#10ACCEPTED0.39 sdetails
#11ACCEPTED0.04 sdetails
#12--details
#13--details
#14ACCEPTED0.04 sdetails

Code

import sys

#inverse mod m of a number only exists if gcd(a,m) = 1 
inp = sys.stdin.read().split()
a = int(inp[0])
m = int(inp[1])

def gcd(a,b):
    if b==0:
        return a
    return gcd(b,a%b)
    
def phi(n):
    result = 1
    for i in range(2, n):
        if gcd(i, n) == 1:
            result += 1
    return result

def modpow(x,n,m):
    if n ==0 :
        return 1 % m
    u = modpow(x,n//2,m)
    u = (u*u) % m 
    if(n%2 == 1) :
        u = (u*x) % m 
    return u
sys.setrecursionlimit(10**6)


val  = gcd(a,m)
if val != 1 or a ==0:
    print(-1)
    exit()

print(modpow(a,phi(m)-1,m))

Test details

Test 1

Verdict: ACCEPTED

input
6 7

correct output
6

user output
6

Test 2

Verdict: ACCEPTED

input
0 7

correct output
-1

user output
-1

Test 3

Verdict: ACCEPTED

input
5 78

correct output
47

user output
47

Test 4

Verdict: ACCEPTED

input
89 99

correct output
89

user output
89

Test 5

Verdict: ACCEPTED

input
0 61

correct output
-1

user output
-1

Test 6

Verdict: ACCEPTED

input
897 947

correct output
625

user output
625

Test 7

Verdict: ACCEPTED

input
419 538

correct output
217

user output
217

Test 8

Verdict: ACCEPTED

input
32 938

correct output
-1

user output
-1

Test 9

Verdict: ACCEPTED

input
184120 505187

correct output
438779

user output
438779

Test 10

Verdict: ACCEPTED

input
264601 885661

correct output
360221

user output
360221

Test 11

Verdict: ACCEPTED

input
40310 590135

correct output
-1

user output
-1

Test 12

Verdict:

input
202254499 577081420

correct output
128866679

user output
(empty)

Test 13

Verdict:

input
539836073 888851205

correct output
797044652

user output
(empty)

Test 14

Verdict: ACCEPTED

input
697847215 756971670

correct output
-1

user output
-1