Cod sursa(job #1553283)
Utilizator | Data | 19 decembrie 2015 15:37:07 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
inline int Put(int x, int n,int cf)
{
int p=1;
while(n>0)
{
if(n&1)
{
p=(1LL*p*x)%cf;
n--;
}
x=(1LL*x*x)%cf;
n=n/2;
}
return p;
}
int main()
{
long long n,a;
f>>n>>a;
g<<Put(a,n-2,n);
return 0;
}