Pagini recente » Cod sursa (job #650521) | Cod sursa (job #3182003) | Cod sursa (job #459629) | Cod sursa (job #1477429) | Cod sursa (job #1936428)
#include <cstdio>
using namespace std;
const long long MOD = 1999999973;
int n, m;
void citire()
{
scanf("%d %d", &n, &m);
}
long long putere(int x, int y)
{
if(y == 1)
{
return x;
}
else
{
if(y % 2 == 0)
{
return putere((x * x * 1LL) % MOD, y / 2) % MOD;
}
else
{
return x * putere((x * x * 1LL) % MOD, y / 2) % MOD;
}
}
}
int main()
{
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);
citire();
printf("%d", putere(n, m));
}