#include<stdio.h>
int power(int n, int k)
{
int p;
if(k==0)
{
p=1;
}
if( k>=1)
{
p=n*power(n,k-1);
}
return p;
}
int main()
{
int r=power(2,9);
printf("%d\n",r);
return 0;
<img src="https://img-blog.csdn.net/20150520202807833?watermark/2/text/aHR0cDovL2Jsb2cuY3Nkbi5uZXQveWJpeGlhbw==/font/5a6L5L2T/fontsize/400/fill/I0JBQkFCMA==/dissolve/70/gravity/Center" alt="" />
}
【c语言】n 的k次方递归
最新推荐文章于 2023-02-24 23:56:50 发布