Pagini recente » Cod sursa (job #2553747) | Cod sursa (job #2407094) | Cod sursa (job #979497) | Cod sursa (job #2655344) | Cod sursa (job #1499352)
#include<cstdio>
using namespace std;
#define MOD 1999999973
long long int n,p;
long long int result;
long long solve(long long n,long long power)
{
if(power==0) return 1;
if(power==1) return n;
long long rezultat=solve((n*n)%MOD,power/2);
if(power%2==0) return rezultat;
return rezultat*n;
}
int main()
{
FILE *fin,*fout;
fin=fopen("lgput.in","r");
fout=fopen("lgput.out","w");
fscanf(fin,"%lld%lld",&n,&p);
fprintf(fout,"%lld",solve(n,p));
}