/* Peter Cline -- July 30, 2007
   Recursively solve a multiplication problem
*/

#include <stdio.h>

int mult(int a, int b);

int main() {

  printf(" = %d\n", mult(6, 3));

  return 0;
}

int mult(int a, int b) {
  int returnVal = 0;

  // base case (simple case)
  if (b == 0) {
    printf("0", a);
    return 0;
  }

  // recurse otherwise
  printf("%d + (", a);
  returnVal = a + mult(a, b-1);
  printf(")");
  return returnVal;
}