递归实现N^K

include<stdio.h>
include<stdlib.h>
int nPowersOfk(int n, int k)
{
	if (k == 0)
	{
		return 1;
	}
	else if (k == 1)
	{
		return n;
	}
	else
	{
		return n*nPowersOfk(n, k - 1);
	}
}
int main()
{
	int n = 0;
	int k = 0;
	scanf("%d", &n);
	scanf("%d", &k);
	int ret = nPowersOfk(n, k);
	printf("%d\n", ret);
	system("pause");
	return 0;
}

猜你喜欢

转载自blog.csdn.net/HuiDiExAg/article/details/89766446