Pagini recente » Cod sursa (job #1327441) | Cod sursa (job #1819790) | Cod sursa (job #1324983) | Cod sursa (job #1324015) | Cod sursa (job #2132840)
#include <stdio.h>
#include <stdlib.h>
#define mod 1999999973;
using namespace std;
long long pow(long long n, long long p){
long long num=1;
while(p>0){
if(p%2==1){
p--;
num=(n*num)%mod;
}
n=(n*n)%mod;
p/=2;
}
return num;
}
int main()
{
FILE *fin, *fout;
long long n,p;
fin=fopen("lgput.in","r");
fout=fopen("lgput.out","w");
fscanf(fin,"%lld%lld",&n,&p);
fprintf(fout,"%lld",pow(n,p));
fclose(fin);
fclose(fout);
return 0;
}