Cod sursa(job #952720)
| Utilizator | Data | 23 mai 2013 20:53:53 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <cstdio>
FILE *f=fopen("inversmodular.in","r");
FILE *g=fopen("inversmodular.out","w");
long long mod;
long long invers(long long a,long long N)
{
long long x1=a,x2=1;
if(N==1)return a;
while(N>1)
if(N%2){x2=(x2*x1)%mod;N--;}
else {x2=(x2*x2)%mod;N/=2;}
return (x1*x2)%mod;
}
int main()
{
long long a,N;
fscanf(f,"%lld%lld",&a,&N);mod=N;
fprintf(g,"%lld",invers(a,N-2));
return 0;
}
