Cod sursa(job #1628349)
Utilizator | Data | 3 martie 2016 23:18:44 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include<stdio.h>
#include<iostream>
#define ll long long
using namespace std;
ll n,a;
ll getphi(ll num)
{
int crt=num;
for(ll i=2;i*i<=num;i++)
{
if(num%i==0)
{
while(num%i==0) num/=i;
crt=(crt/i)*(i-1);
}
}
if(num!=1) crt=crt/num*(num-1);
return crt;
}
int main()
{
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
scanf("%d%d",&a,&n);
ll put=getphi(n)-1;
ll sol=a;
for(int i=0;(1<<i)<=put;i++)
{
if((1<<i)&put) sol=(sol*a)%n;
a=(a*a)%n;
}
return 0;
}