Pagini recente » Cod sursa (job #2865591) | Cod sursa (job #2782166) | Borderou de evaluare (job #2635800) | Borderou de evaluare (job #2663819) | Cod sursa (job #484138)
Cod sursa(job #484138)
#include <stdio.h>
using namespace std;
#define MOD 1999999973
int bin[1001];
long long n, p, rez = 1;
int i, j;
int main ()
{
FILE *f = fopen ("lgput.in","r");
FILE *g = fopen ("lgput.out","w");
fscanf (f,"%lld %lld", &n, &p);
while (p)
{
i ++;
bin[i] = p % 2;
p /= 2;
}
for (j=i; j>=1; --j)
{
rez = (rez * rez) % MOD;
if (bin[j])
rez = (rez * n) % MOD;
}
fprintf (g, "%lld\n", rez);
fclose (g);
fclose (f);
return 0;
}