title: Maximize Volume Cuboid Given Sum Sides
signature: pub fn maximize_volume_cuboid_given_sum_sides(s: 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(s: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(s), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        67, 
        11132
      ));
      
      println!("TEST-1...{}", driver(
        48, 
        4096
      ));
      
      println!("TEST-2...{}", driver(
        59, 
        7600
      ));
      
      println!("TEST-3...{}", driver(
        22, 
        392
      ));
      
      println!("TEST-4...{}", driver(
        14, 
        100
      ));
      
      println!("TEST-5...{}", driver(
        66, 
        10648
      ));
      
      println!("TEST-6...{}", driver(
        1, 
        0
      ));
      
      println!("TEST-7...{}", driver(
        75, 
        15625
      ));
      
      println!("TEST-8...{}", driver(
        58, 
        7220
      ));
      
      println!("TEST-9...{}", driver(
        78, 
        17576
      ));
      
  }
source_py: def maximize_volume_cuboid_given_sum_sides(s):
      maxvalue = 0
      i = 1
      for i in range((s - 1)):
          j = 1
          for j in range(s):
              k = ((s - i) - j)
              maxvalue = max(maxvalue, ((i * j) * k))
      return maxvalue
source_cpp: int maximize_volume_cuboid_given_sum_sides(int s) {
    int maxvalue = 0;
    for ( int i = 1;
    i <= s - 2;
    i ++ ) {
      for ( int j = 1;
      j <= s - 1;
      j ++ ) {
        int k = s - i - j;
        maxvalue = max ( maxvalue, i * j * k );
      }
    }
    return maxvalue;
  }