Pagini recente » Cod sursa (job #2152529) | Cod sursa (job #628165) | Cod sursa (job #371161) | Cod sursa (job #1501523) | Cod sursa (job #3152747)
#include <fstream>
using namespace std;
ifstream cin("lgput.in");
ofstream cout("lgput.out");
long long modulo = 1999999973;
unsigned long long lgput(unsigned long long n, unsigned long long k)
{
if(n < 0)
{
return lgput(1/n, -k) % modulo;
}
if(k == 0)
return 1;
if(k == 1)
return n;
if(k % 2 == 0)
return (lgput(n*n, k/2)) % modulo;
else
return n*(lgput(n*n, (k-1) / 2)) % modulo;
}
int main()
{
unsigned long long n, k;
cin >> n >> k;
cout<<lgput(n, k)%modulo;
return 0;
}