递归求n的k次方

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h> 
#include <stdlib.h>
int Second(int n,int k) {
	/*int sum = 1;
	for (int i = 1; i <= k; ++i) {
		sum *= n;
	}
	return sum;*/
	if (k == 1) {
		return n;
	}
	else {
		return n*Second(n, k - 1);
	}
}

int main() {
	int n,k,sum;
	printf("请输入n和k的值\n");
	scanf("%d %d", &n,&k);
	sum = Second(n,k);
	printf("%d\n", sum);
	system("pause");
	return 0;
}