Cod sursa(job #2170819)
Utilizator | Data | 15 martie 2018 09:52:43 | |
---|---|---|---|
Problema | Invers modular | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#define mod 1999999973
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
long long n,x,copie;
int fct()
{
long long p=1;
while(n)
{
if(n%2)
{p=(p*x)%mod;n--;}
x=(x*x)%mod;
p%=mod;
n/=2;
}
p%=mod;
return p;
}
int main()
{
f>>x>>n;
g<<fct();
return 0;
}