Pagini recente » Cod sursa (job #839509) | Cod sursa (job #1952019) | Cod sursa (job #1358474) | Cod sursa (job #2207623) | Cod sursa (job #1047373)
#include <iostream>
#include <fstream>
using namespace std;
long long modulo=1999999973;
int exp(long long n, long long p){
if(p<0)
return exp(1/n,-p);
else if(p==0)
return 1;
else if(p==1)
return n;
else if(p%2==0)
return exp((n*n)%modulo,p/2)%modulo;
else if(p%2==1)
return n*exp((n*n)%modulo,(p-1)/2)%modulo;
}
int main()
{
long long n,p;
ifstream f("lgput.in");
ofstream g("lgput.out");
f>>n>>p;
cout<<exp(n,p);
return 0;
}