Pagini recente » Cod sursa (job #27287) | Cod sursa (job #538225) | Diferente pentru problema/pscfft intre reviziile 4 si 3 | Cod sursa (job #428925) | Cod sursa (job #211854)
Cod sursa(job #211854)
#include<iostream.h>
#include <stdio.h>
#include <string.h>
//const int m = 1999999973;
int main()
{
unsigned int i, n, p;
long long a, sol;
a=1;
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%u%u", &n, &p);
while(p)
{
if(n%2==0)a=a*n;
n=n*n;
p=p/2;
}
printf("%lld\n",a);
return 0;
}