Pagini recente » Cod sursa (job #1249858) | Cod sursa (job #581347) | Cod sursa (job #624303) | Charlie | Cod sursa (job #1723485)
#include <bits/stdc++.h>
#define modulo 1999999973
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
long long LgPut(long long n, long long p)
{
long long k = 1;
while(p)
{
if(p % 2 == 1)
{
k = 1LL * (k * n);
k %= modulo;
p--;
}
else
{
n = n * n % modulo ;
p /= 2;
}
}
return k ;//% 1999999973;
}
int main()
{
long long n, p;
f >> n >> p;
f.close();
g << LgPut(n, p);
g.close();
return 0;
}