Pagini recente » Cod sursa (job #2072510) | Cod sursa (job #3263032) | Cod sursa (job #1191526) | Cod sursa (job #1026067) | Cod sursa (job #2152986)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int LgPow(int a,int b,int MOD){
int P=a,Ans=1;
for(ll i=0;(1LL<<i)<=1LL*b;++i){
if((1<<i)&b) Ans=1LL*Ans*P%MOD;
P=1LL*P*P%MOD;
}
return Ans;
}
int InvMod(int A,int MOD){
return LgPow(A,MOD-2,MOD);
}
int main(){
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
int A,N;
cin>>A>>N;
cout<<InvMod(A,N);
}