title: Recursively Break Number 3 Parts Get Maximum Sum
signature: pub fn recursively_break_number_3_parts_get_maximum_sum(n: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        39, 
        41
      ));
      
      println!("TEST-1...{}", driver(
        79, 
        87
      ));
      
      println!("TEST-2...{}", driver(
        7, 
        7
      ));
      
      println!("TEST-3...{}", driver(
        76, 
        87
      ));
      
      println!("TEST-4...{}", driver(
        48, 
        57
      ));
      
      println!("TEST-5...{}", driver(
        18, 
        19
      ));
      
      println!("TEST-6...{}", driver(
        58, 
        63
      ));
      
      println!("TEST-7...{}", driver(
        17, 
        17
      ));
      
      println!("TEST-8...{}", driver(
        36, 
        41
      ));
      
      println!("TEST-9...{}", driver(
        5, 
        5
      ));
      
  }
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 );
  }