title: Dynamic Programming Set 36 Cut A Rope To Maximize Product 1
signature: function dynamicProgrammingSet36CutARopeToMaximizeProduct1(n) {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value) {
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual, expected){
      return convertToString(actual)===convertToString(expected);
  }
  
  function driver(n, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(62, 6973568802);
    console.log(`TEST-0...${result}`);
  
    result = driver(53, 258280326);
    console.log(`TEST-1...${result}`);
  
    result = driver(8, 18);
    console.log(`TEST-2...${result}`);
  
    result = driver(6, 9);
    console.log(`TEST-3...${result}`);
  
    result = driver(35, 354294);
    console.log(`TEST-4...${result}`);
  
    result = driver(35, 354294);
    console.log(`TEST-5...${result}`);
  
    result = driver(46, 19131876);
    console.log(`TEST-6...${result}`);
  
    result = driver(74, 564859072962);
    console.log(`TEST-7...${result}`);
  
    result = driver(69, 94143178827);
    console.log(`TEST-8...${result}`);
  
    result = driver(3, 2);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
source_py: def dynamic_programming_set_36_cut_a_rope_to_maximize_product_1(n):
      if ((n == 2) or (n == 3)):
          return (n - 1)
      res = 1
      while (n > 4):
          n -= 3
          res *= 3
      return (n * res)
source_cpp: int dynamic_programming_set_36_cut_a_rope_to_maximize_product_1(int n) {
    if ( n == 2 || n == 3 ) return ( n - 1 );
    int res = 1;
    while ( n > 4 ) {
      n -= 3;
      res *= 3;
    }
    return ( n * res );
  }