Pagini recente » Cod sursa (job #2853437) | Cod sursa (job #2162633) | Monitorul de evaluare | Cod sursa (job #989158) | Cod sursa (job #352547)
Cod sursa(job #352547)
#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 %M ) * (pow(a*a, n>>1) %M ) %M );
return (int) ( long long ) (pow(a*a, 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;
}