title: Dynamic Programming Set 36 Cut A Rope To Maximize Product 1
signature: function dynamicProgrammingSet36CutARopeToMaximizeProduct1(n: number): number {
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 );
  }
question_info.test_list: [{"idx": 0, "outputs": 6973568802, "inputs": {"n": 62}}, {"idx": 1, "outputs": 258280326, "inputs": {"n": 53}}, {"idx": 2, "outputs": 18, "inputs": {"n": 8}}, {"idx": 3, "outputs": 9, "inputs": {"n": 6}}, {"idx": 4, "outputs": 354294, "inputs": {"n": 35}}, {"idx": 5, "outputs": 354294, "inputs": {"n": 35}}, {"idx": 6, "outputs": 19131876, "inputs": {"n": 46}}, {"idx": 7, "outputs": 564859072962, "inputs": {"n": 74}}, {"idx": 8, "outputs": 94143178827, "inputs": {"n": 69}}, {"idx": 9, "outputs": 2, "inputs": {"n": 3}}]
question_info.entry_cls_name: Solution
question_info.test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value: any): string{
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual: number, expected: number): boolean {
      return convertToString(actual) === convertToString(expected);
  }
  
  function driver(n: number, expected:number): string {
      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}`);
  
  };
  
  main();
question_info.extension: ts
question_info.entry_fn_name: dynamicProgrammingSet36CutARopeToMaximizeProduct1
question_info.test_case_ids: 0 1 2 3 4 5 6 7 8 9
question_info.commands: tsc --target es2020 --lib es5,dom,es2015,es2020 __FILENAME__
question_info.commands: node __FILENAME__.js