Pagini recente » Borderou de evaluare (job #1854661) | Diferente pentru problema/maxflow intre reviziile 21 si 31 | Borderou de evaluare (job #3111957) | Borderou de evaluare (job #3152639) | Cod sursa (job #379072)
Cod sursa(job #379072)
#include<stdio.h>
#include<fstream>
using namespace std;
#define m 1999999973;
int p;
long long mod=1,a,n;
int main()
{
FILE *f=fopen("lgput.in","r");
FILE *g=fopen("lgput.out","w");
fscanf(f,"%lld %d",&n,&p);
while(p>0)
{
if(p%2==1)
mod*=n%m;
n=n*n%m;
p=p/2;
}
fprintf(g,"%lld",mod);
fclose(f);
fclose(g);
return 0;
}