用遞歸實現n的k次方

#include <stdio.h>
int num(int n,int k)
{	
	static int count = 0;			//必須用靜態變量來定義count，count每次調用不會被釋放
	int sum = 1;
	if(k == 0)
		return 1;
	if(count == k)
		return 1;
	count++;
	sum = n*num(n,k);
	return sum;
}
int main()
{
	int i;
	i = num(3,2);
	printf("%d\n",i);
	return 0;
}