Pagini recente » Cod sursa (job #1420385) | Cod sursa (job #2416955) | Cod sursa (job #721715) | Cod sursa (job #1584609) | Cod sursa (job #445502)
Cod sursa(job #445502)
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
long long putere(int n,int p)
{
/*if (p==0) return (long long)1;
if (p==1) return (long long)n;
if (p%2==0) return putere(n,p/2)*putere(n,p/2);
else return putere(n,p/2)*putere(n,p/2)*n;*/
long long r=1;
long long nn=n;
while (p>0)
{
if (p%2==1)
{
r*=nn;
r%=1999999973;
p-=1;
}
nn*=nn;
nn%=1999999973;
p/=2;
}
r%=1999999973;
return r;
}
int main()
{
FILE *in=fopen("lgput.in","r");
FILE *out=fopen("lgput.out","w");
int n,p;
//long long t=1999999973;
fscanf(in,"%d %d",&n,&p);
fprintf(out,"%lld",putere(n,p));
fclose(in); fclose(out);
return 0;
}