数学趣题——递归法求幂

#include "stdio.h"

unsigned long myPow(int m, int n)
{
    unsigned long tmp;

    if(n == 0) return 1;

    if(n == 1) return m;

    if(n % 2 == 0) {
        tmp = myPow(m, n / 2);
        return tmp * tmp;
    }

    if(n % 2 != 0)
        return m * myPow(m, n - 1);
}

int main()
{
    int m, n;
    printf("Please input the bottom number\n");
    scanf("%d", &m);                            /*输入底数m*/
    printf("Please input the exponent number\n");
    scanf("%d", &n);                            /*输入指数n*/
    printf("The result of power(m,n) is %ld\n", myPow(m, n));        /*输出计算结果mn*/
    return 0;
}