Pagini recente » Cod sursa (job #368203) | Cod sursa (job #338301) | Cod sursa (job #593420) | Cod sursa (job #299815)
Cod sursa(job #299815)
#include <cstdio>
#define B 1999999973
int n, p;
long power(int n, int p)
{
if (p == 0)
return 1;
else
if (p % 2 == 1)
return n * power(n, p-1) % B;
else
{
long chestie = power(n, p / 2) % B;
return (chestie * chestie) % B;
}
}
int main()
{
FILE *f = fopen("lgput.in", "r");
fscanf(f, "%d%d", &n, &p);
fclose(f);
f = fopen("lgput.out", "w");
if (n != 1 && n != 0)
fprintf(f, "%ld", power(n, p));
else
if (n == 0)
fprintf(f, "0\n");
else
fprintf(f, "1\n");
fclose(f);
return 0;
}