title: Recursively Break Number 3 Parts Get Maximum Sum
signature: int recursivelyBreakNumber3PartsGetMaximumSum(int n) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual == expected;
  }
  
  string driver(int n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(39, 41); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(79, 87); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(7, 7); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(76, 87); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(48, 57); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(18, 19); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(58, 63); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(17, 17); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(36, 41); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(5, 5); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
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 );
  }