Pagini recente » Cod sursa (job #1685747) | Cod sursa (job #1854372) | Cod sursa (job #1297879) | Cod sursa (job #1911874) | Cod sursa (job #1296972)
#include <iostream>
using namespace std;
const long long k = 1999999973;
long long putere(long long n, long long p) {
if(p==1)
return n % k;
if(p%2)
return (n*putere((n*n) % k, p/2)) % k;
else
return putere((n*n) % k, p/2);
}
int main()
{
FILE *in, *out;
in = fopen("lgput.in", "r");
out = fopen("lgput.out", "w");
long long n, p;
fscanf(in, "%lld %lld", &n, &p);
fprintf(out, "%lld\n", putere(n, p));
fclose(in);
fclose(out);
return 0;
}