#include<cstdio>
unsigned long myPow(int m,int n)
{
unsigned long tmp;
if(n==1)
return m;
if(n==0)
return 1;
if(n%2==0)
{
tmp=myPow(m,n/2);
return tmp*tmp;
}
if(n%2!=0)
{
return m*myPow(m,n-1);
}
}
int main()
{
int n,m;
while(scanf("%d%d",&m,&n)!=EOF)
{
printf("%d\n",myPow(m,n));
}
return 0;
}
递归求幂
最新推荐文章于 2022-11-16 23:28:19 发布