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

#include<stdio.h>
#include<Windows.h>

int chengfang(int n,int k)
{
    if (k == 1)
    {
        return n;
    }
    else if(k > 1)
    {
        k--;
        return n*chengfang(n,k);
    }

}
int main()
{
    int n = 0;
    int k = 0;
    printf("请输入底数n=");
    scanf("%d", &n);
    printf("请输入指数k=");
    scanf("%d",&k);
    printf("n^k=%d\n", chengfang(n, k));
    system("pause");
    return 0;
}