Cod sursa(job #3243322)
| Utilizator | Data | 17 septembrie 2024 16:16:02 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("Igput.in");
ofstream fout("Igput.out");
int mod=1999999973;
int lgpow(int a, int n){
if (n==0){
return 1;
}
else if (n%2==1){
return (long long)(lgpow(a, n-1)*a)%mod;
}
int p;
p=lgpow(a,n/2);
return (long long) (p*p)%mod;
}
int main()
{
int n,p;
fin>>n>>p;
cout<<lgpow(n,p);
return 0;
}
