n^k

编写一个函数实现n^k,使用递归实现

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
float Power(float n,int k) {
	if (k == 0) {
		return 1;
	}
	else if (k == 1) {
		return n;
	}
	else {
		return n * Power(n, k - 1);
	}
}
int main() {
    int n, k;
	scanf("%d %d", &n, &k);
	printf("%f", Power(n, k));
	system("pause");
	return 0;
}

猜你喜欢

转载自blog.csdn.net/Lange_Taylor/article/details/88920781
n^k