Pagini recente » Cod sursa (job #2886109) | Cod sursa (job #79942) | Cod sursa (job #1019459) | Cod sursa (job #2618631) | Cod sursa (job #2531463)
#include <bits/stdc++.h>
using namespace std;
ifstream f("lgput.in");
ofstream g("lgput.out");
const int MOD = 1999999973;
int N, P;
static inline int lgput (int n, int p, int Mod)
{
long long ans = 1, aux = n;
for(int i = 0; (1 << i) <= p; ++i)
{
if(p & (1 << i))
ans = (ans * aux) % Mod;
aux = (aux * aux) % Mod;
}
return ans;
}
int main ()
{
f.tie(NULL);
f >> N >> P;
g << lgput(N, P, MOD) << '\n';
return 0;
}