Pagini recente » Cod sursa (job #314629) | Borderou de evaluare (job #107999) | Diferente pentru problema/logic intre reviziile 9 si 8 | Cod sursa (job #3259808) | Cod sursa (job #1366041)
#include <stdio.h>
#define mod 1999999973
unsigned long i,n,p;
unsigned long long pow;
int main()
{
FILE*f1,*f2;
f1=fopen("lgput.in","r");
f2=fopen("lgput.out","w");
fscanf(f1,"%lu%lu",&n,&p);
pow=n;
if(p==0)
fprintf(f2,"%lu",1);
if(p==1)
fprintf(f2,"%lu",n);
/*for(;i<p;)
{
pow=(pow*pow)%mod;
i=i*2;
}*/
return 0;
}