Pagini recente » Arhiva de probleme | Arbori Indexati Binar | Cod sursa (job #202406) | Arhiva de probleme | Cod sursa (job #256768)
Cod sursa(job #256768)
#include<stdio.h>
#define md 1999999973
long long pow(long long x, long long n)
{
long long result = 1;
while (n) {
if (n) {
result =(result%md * x%md)%md;
}
x=(x%md*x%md)%md;
n/=2;
}
return result;
}
int main()
{
long long a,b;
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%lld %lld",&a,&b);
printf("%lld\n",pow(a,b));
return 0;
}