Cod sursa(job #2803644)
Utilizator | Data | 20 noiembrie 2021 12:07:14 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include <bits/stdc++.h>
using namespace std;
int MOD;
int pw(int x, int y){
if(y==0) return 1;
int z=pw(x,y/2);
if(y%2) return z*z*x;
return z*z;
}
inline int invMod(int x){
int ans=pw(x,x-2);
return ans%MOD;
}
int main(){
int x,y;
cin>>MOD>>x;
cout<<(invMod(x)+MOD)%MOD+1;
}