Task: | Finding inverse |
Sender: | HFalke |
Submission time: | 2024-11-16 22:47:18 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | ACCEPTED |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.00 s | details |
#2 | ACCEPTED | 0.00 s | details |
#3 | ACCEPTED | 0.00 s | details |
#4 | ACCEPTED | 0.00 s | details |
#5 | ACCEPTED | 0.00 s | details |
#6 | ACCEPTED | 0.00 s | details |
#7 | ACCEPTED | 0.00 s | details |
#8 | ACCEPTED | 0.00 s | details |
#9 | ACCEPTED | 0.00 s | details |
#10 | ACCEPTED | 0.00 s | details |
#11 | ACCEPTED | 0.00 s | details |
#12 | ACCEPTED | 0.00 s | details |
#13 | ACCEPTED | 0.00 s | details |
#14 | ACCEPTED | 0.00 s | details |
Code
#include <bits/stdc++.h>using namespace std;//Definitions for quicker writing#define REP(i,a,b) for (int i = a; i < b; i++)#define clz __builtin_clz#define ctz __builtin_ctz#define popct __builtin_popcount#define PB push_back#define MP make_pair#define F first#define S second#define X real()#define Y imag()//Typedefs for quicker writingtypedef long long ll;typedef vector<int> vi;typedef vector<long long> vl;typedef pair<int,int> pi;typedef pair<long long, long long> pl;typedef complex<long long> po;//Max valuesconst long long lmx = LLONG_MAX;const int imx = INT_MAX;ll modpow(ll x, ll n, ll m) {if (n == 0) return 1%m;ll u = modpow(x,n/2,m);u = (u*u)%m;if (n%2 == 1) u = (u*x)%m;return u;}ll gcd(ll a, ll b){if(b==0) return a;return gcd(b,a%b);}ll totient(ll n){ll res = n;for(ll i=2; i*i <= n; i++){if(n%i == 0){while(n%i == 0){n /= i;}res -= res/i;}}if(n>1) res -= res/n;return res;}int main() {//IO optimizationios::sync_with_stdio(0);cin.tie(0);//Input definitionll a,m;//Read Incin >> a >> m;//Main partll res;if(a==0 || m == 0){res = -1;}else{if(gcd(a,m) != 1){res = -1;}else{ll tot = totient(m);res = modpow(a, tot-1, m);}}//Write outcout << res << "\n";//Returnreturn 0;}
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: ACCEPTED
input |
---|
202254499 577081420 |
correct output |
---|
128866679 |
user output |
---|
128866679 |
Test 13
Verdict: ACCEPTED
input |
---|
539836073 888851205 |
correct output |
---|
797044652 |
user output |
---|
797044652 |
Test 14
Verdict: ACCEPTED
input |
---|
697847215 756971670 |
correct output |
---|
-1 |
user output |
---|
-1 |