Pagini recente » Cod sursa (job #2970279) | Cod sursa (job #3271254) | Cod sursa (job #3205961) | Cod sursa (job #2136626) | Cod sursa (job #1743201)
#include <stdio.h>
long long modulo = 1999999973;
unsigned long long solve(long long x,long long n)
{
if (n == 0)
return 1;
else if (n == 1)
return x % modulo;
if (n % 2 == 0) return solve((x * x) % modulo, n/2);
if (n % 2 != 0) return (x % modulo) * solve((x * x) % modulo,(n-1)/2);
}
int main()
{
unsigned long long x, n;
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%d %d", &x, &n);
printf("%lld",solve(x,n) % modulo);
return 0;
}