用递归求n的几次方

#include <stdio.h>

double pow(double x,int n)
{
    double num;
    if(n==0)
    {
    num=1;
    }
    else
    {
    num = x * pow(x,n-1);
    }
    return num;
}


int main()
{
    double x,num;
    int n;
    scanf("%lf%d",&x,&n);
    printf("%lf\n",pow(x,n));
}