Cod sursa(job #1623789)
Utilizator | Data | 1 martie 2016 21:39:32 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int a,n;
int main()
{
int nr,put,i;
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
cin>>a>>n;
nr=a;
int p=n-2;
int sol=1;
int mod=n;
for(i=0;(1<<i)<=p;i++)
{
if((1<<i)&p) sol=(sol*nr)%mod;
nr=nr*nr %mod;
}
cout<<sol<<'\n';
return 0;
}