Pagini recente » Borderou de evaluare (job #1878534) | Diferente pentru summer-challenge-2021/solutii/transform3 intre reviziile 6 si 2 | Borderou de evaluare (job #1247316) | Cod sursa (job #48612) | Cod sursa (job #804396)
Cod sursa(job #804396)
#include <stdio.h>
#define mod 1999999973
using namespace std;
FILE *f=fopen("lgput.in","r"), *g=fopen("lgput.out","w");
int main()
{
long long int n, p, i, sol=1;
fscanf(f,"%lld%lld",&n,&p);
for(i=0;(1<<i)<=p;i++)
{
if((1<<i)&p)
sol=(sol*n)%mod;
n=(n*n)%mod;
}
fprintf(g, "%lld", sol);
return 0;
}