Cod sursa(job #2493595)
Utilizator | Data | 16 noiembrie 2019 15:47:23 | |
---|---|---|---|
Problema | Invers modular | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
//#include <iostream>
using namespace std;
ifstream cin("inversmodular.in");
ofstream cout("inversmodular.out");
int N,a;
int putere(int n, int p)
{
int ans=1;
while(p)
{
if(p%2)
ans=(1ll*ans*n)%N;
n=(1LL*n*n)%N;
p/=2;
}
return ans;
}
int invers(int x)
{
return putere(x,N-2);
}
int main()
{
cin>>a>>N;
cout<<invers(a);
return 0;
}