Pagini recente » Cod sursa (job #273081) | Cod sursa (job #670102) | Cod sursa (job #2123862) | Cod sursa (job #776423) | Cod sursa (job #1842434)
#include <stdio.h>
#define m 1999999973
using namespace std;
int i, p;
long long n;
int lgput(long long n, int p)
{
if(!p) return 1;
else if(p == 1) return n % m;
else if(p % 2) return ((n % m) * lgput((n * n) % m, (p - 1) / 2)) % m;
else return lgput((n * n) % m, p / 2) % m;
}
int main()
{
freopen("lgput.in", "r", stdin);
freopen("lgput.out", "w", stdout);
scanf("%lld%d", &n, &p);
printf("%d", lgput(n, p));
return 0;
}