Pagini recente » Cod sursa (job #11330) | Cod sursa (job #870842) | Cod sursa (job #2307071) | Cod sursa (job #1196742) | Cod sursa (job #1732751)
#include <stdio.h>
const int mod=1999999973;
inline long long lgput(int n,int p)
{
long long a=1;
while(p)
{
if(p&1)
a=(a*n)%mod;
n=(n*n)%mod;
p/=2;
}
return a;
}
int main()
{
FILE *fin,*fout;
fin=fopen("lgput.in","r");
fout=fopen("lgput.out","w");
int n,p;
fscanf(fin,"%d%d",&n,&p);
fprintf(fout,"%lld",lgput(n,p));
fclose(fin);
fclose(fout);
return 0;
}