递归法求幂

#include <iostream>#include <cmath>#include <cstdio>using namespace std;int myPow(int m, int n){    int temp;    if(0 == n){       return 1;    }    if(1 == n){       return m;    }    if(n%2 == 0){       temp = myPow(m, n/2);       return temp*temp;    }    if(n%2 != 0){       return m*myPow(m, n-1);    }    return 0; } int main() {     int m, n;     scanf("%d%d", &m, &n);     printf("%d\n", myPow(m, n));     return 0; }