hay look at my recursive pow


#include <stdio.h>
#include <stdlib.h>

unsigned long long rpow(int n, int p) {
  return p ? p==1 ? n : n * rpow(n,p-1) : 1;
}

int main(int argc, char **argv) {
  if(argv[1])
    if(argv[2]) {
      int n = atoi(argv[1]);
      int p = atoi(argv[2]);
      printf("%llu\n",rpow(n,p));
    }
  return 0;
}

>>102
I use the definitions which suits the description of intended functionality,not the algorithms.
_____________________________________________
Refusal to believe until proof is given is a rational position; denial of all outside of our own limited experience is absurd.