递归实现n的k次方

# define _CRT_SECURE_NO_WARNINGS 1
# include<stdio.h>

int pow(int n, int k)
{
	int a = 1;
	if (a==k)
		return n;
	else
	{
		a ++;
		return n * pow(n, k-1);
	}		
}

int main(void)
{
	int n = 0;
	int k = 0;
	scanf("%d %d", &n, &k);

	int x = pow(n, k);

	printf("%d", x);

	return 0;
}