Pagini recente » Cod sursa (job #2291350) | Cod sursa (job #771071) | Cod sursa (job #207166) | Cod sursa (job #315929) | Cod sursa (job #2221591)
#include <iostream>
#include <cstdio>
#define PRIM 1999999973
using namespace std;
long long int puteri[100];
int main()
{
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);
long long int a, b;
scanf("%lld", &a);
scanf("%lld", &b);
long long int p = b;
puteri[1] = a;
int i = 1;
while(p)
{
puteri[i + 1] = (puteri[i] * puteri[i]) % PRIM;
p >>= 1;
++i;
}
long long int res = 1;
for(long long int j = 0; 1 << j <= b; ++j)
{
if((1 << j) & b)
{
res *= puteri[j + 1];
res %= PRIM;
}
}
printf("%lld", res);
return 0;
}