Pagini recente » Cod sursa (job #2926194) | Cod sursa (job #420506) | Cod sursa (job #546379) | Cod sursa (job #3249026) | Cod sursa (job #1083865)
#include<cstdio>
#include<cmath>
FILE *in,*out;
const long long MOD=1999999973;
long long int n,p;
long long int dub(long long int x)
{
return (x*x)%MOD;
}
long long int pow(long long int a, long long int b)
{
if(!b)
return 1;
if(b==1)
return a;
if(!(b%2))
return dub(pow(a, b / 2));
return (a*dub(pow(a,b /2)))%MOD;
}
int main ()
{
in=fopen("lgput.in","rt");
fscanf(in,"%lld%lld",&n,&p);
fclose(in);
out=fopen("lgput.out","wt");
fprintf(out,"%lld", pow(n,p));
fclose(out);
return 0;
}