Pagini recente » Cod sursa (job #120160) | Cod sursa (job #844287) | Borderou de evaluare (job #1169595) | Cod sursa (job #1689632) | Cod sursa (job #1973531)
#include <bits/stdc++.h>
using namespace std;
ifstream in("lgput.in");
ofstream out("lgput.out");
const long mod=1999999973;
long long n,p;
long long lgput(long long n,long long p)
{
if (p==1) return n;
else if (p%2==0) return lgput(n*n,p/2);
else if (p*2==1) return n*lgput(n*n,(p-1)/2);
}
int main()
{
in>>n>>p;
out<<lgput(n,p)%mod;
return 0;
}