title: Recursively Break Number 3 Parts Get Maximum Sum
signature: recursivelyBreakNumber3PartsGetMaximumSum(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          39, 
          41)
      }");
  
      print("TEST-1...${driver(
          79, 
          87)
      }");
  
      print("TEST-2...${driver(
          7, 
          7)
      }");
  
      print("TEST-3...${driver(
          76, 
          87)
      }");
  
      print("TEST-4...${driver(
          48, 
          57)
      }");
  
      print("TEST-5...${driver(
          18, 
          19)
      }");
  
      print("TEST-6...${driver(
          58, 
          63)
      }");
  
      print("TEST-7...${driver(
          17, 
          17)
      }");
  
      print("TEST-8...${driver(
          36, 
          41)
      }");
  
      print("TEST-9...${driver(
          5, 
          5)
      }");
  
      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 );
  }