title: Recursively Break Number 3 Parts Get Maximum Sum
signature: recursively_break_number_3_parts_get_maximum_sum <- function(n) {
test_code: 
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  validate_solution <- function(actual, expected) {
      toString(actual)==toString(expected)
  }
  
  driver <- function(n, expected){
      if (validate_solution(PLACEHOLDER_FN_NAME(n), expected)){
          "PASSED"
      } else{
          "FAILED"
      }
  }
  
  main <- function() {
      cat(sprintf("TEST-0...%s\n",driver(
          39L, 
          41L
      )))
  
      cat(sprintf("TEST-1...%s\n",driver(
          79L, 
          87L
      )))
  
      cat(sprintf("TEST-2...%s\n",driver(
          7L, 
          7L
      )))
  
      cat(sprintf("TEST-3...%s\n",driver(
          76L, 
          87L
      )))
  
      cat(sprintf("TEST-4...%s\n",driver(
          48L, 
          57L
      )))
  
      cat(sprintf("TEST-5...%s\n",driver(
          18L, 
          19L
      )))
  
      cat(sprintf("TEST-6...%s\n",driver(
          58L, 
          63L
      )))
  
      cat(sprintf("TEST-7...%s\n",driver(
          17L, 
          17L
      )))
  
      cat(sprintf("TEST-8...%s\n",driver(
          36L, 
          41L
      )))
  
      cat(sprintf("TEST-9...%s\n",driver(
          5L, 
          5L
      )))
  
  }
  
  main()
source_py: def recursively_break_number_3_parts_get_maximum_sum(n):
      if ((n == 0) or (n == 1)):
          return n
      return max(((recursively_break_number_3_parts_get_maximum_sum((n // 2)) + recursively_break_number_3_parts_get_maximum_sum((n // 3))) + recursively_break_number_3_parts_get_maximum_sum((n // 4))), n)
source_cpp: int recursively_break_number_3_parts_get_maximum_sum(int n) {
    if ( n == 0 || n == 1 ) return n;
    return max ( ( recursively_break_number_3_parts_get_maximum_sum ( n / 2 ) + recursively_break_number_3_parts_get_maximum_sum ( n / 3 ) + recursively_break_number_3_parts_get_maximum_sum ( n / 4 ) ), n );
  }