Pagini recente » Cod sursa (job #1241454) | Cod sursa (job #37980) | Cod sursa (job #1195868) | Cod sursa (job #2779238) | Cod sursa (job #3215906)
#include <iostream>
#include <stdio.h>
#define int long long
using namespace std;
int InvMod1(int a,int put,int mod){
int ans;
ans=1;
while(put>0){
if(put%2==1){
ans*=a;
ans%=mod;
}
a*=a;
a%=mod;
put/=2;
}
return ans;
}
signed main(){
int a,n;
FILE *fin,*fout;
fin=fopen("inversmodular.in","r");
fout=fopen("inversmodular.out","w");
fscanf(fin,"%lld%lld",&a,&n);
fprintf(fout,"%lld",InvMod1(a,n-2,n));
fclose(fin);
fclose(fout);
return 0;
}