递归实现n的k次方

#include<stdio.h>
int  cifang(int n,int k)
{
	int a = 0;
	if (k ==0 || n ==1)
	{
		return 1;
	}
	else
	{
		k--;
		a = n * cifang(n,k);
		return a;
	}
}
int main() {
	int n,k;
	printf("请输入两个数字n,k");
	scanf_s("%d %d", &n,&k);
	printf("%d", cifang(n,k));
	return 0;

}