Pagini recente » Cod sursa (job #31550) | Cod sursa (job #2764046) | Cod sursa (job #933831) | Cod sursa (job #2438751) | Cod sursa (job #352551)
Cod sursa(job #352551)
#include<cstdio>
int const M=1999999973;
int n,p;
int pow(int a, int n)
{
if (!n) return 1;
if (n & 1 ) return (int) ( ( long long )a * pow((long long)a*a%M, n>>1) %M );
return (int) ( long long ) (pow((long long)a*a%M, n>>1) %M );
}
int main()
{
freopen("lgput.in","r",stdin);
freopen("lgput.out","w",stdout);
scanf("%d%d", & n, & p);
int a=pow (n , p);
printf ("%d\n", a);
return 0;
}