title: Dynamic Programming Set 36 Cut A Rope To Maximize Product 1
signature: function dynamic_programming_set_36_cut_a_rope_to_maximize_product_1(n)
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_code: 
  
  -- SOLUTION CODE
  -- ============================================
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  function isCorrect(actual, expected)
      if type(expected) ~= type(actual) then
          return false
      end
      
      if type(expected) == 'table' then
          for k,v_expected in pairs(expected) do
              
              if actual[k] == nil then
                  return false
              end
              local v_actual = actual[k]
              if not isCorrect(v_actual, v_expected) then
                  return false
              end
              actual[k]=nil
          end
      
          if next(actual) then 
              return false
          end
          return true
      else
          return actual == expected
      end
  end
  
  function validateSolution(actual, expected)
      return isCorrect(actual,expected)
  end
  
  function driver(n, expected)
      local exec_result;
      local status, error_msg = pcall(function () 
          exec_result=PLACEHOLDER_FN_NAME(n) 
      end)
      if status then
          if validateSolution(exec_result,expected) then
              return "PASSED"
          end
          return "FAILED"
      else
          return string.format("ERROR=%s",string.gsub(error_msg,".*:[%d]+: ",""))
      end
  end
      
  function main()
      result = driver(62, 6973568802)
      print(string.format("TEST-0...%s",result))
  
      result = driver(53, 258280326)
      print(string.format("TEST-1...%s",result))
  
      result = driver(8, 18)
      print(string.format("TEST-2...%s",result))
  
      result = driver(6, 9)
      print(string.format("TEST-3...%s",result))
  
      result = driver(35, 354294)
      print(string.format("TEST-4...%s",result))
  
      result = driver(35, 354294)
      print(string.format("TEST-5...%s",result))
  
      result = driver(46, 19131876)
      print(string.format("TEST-6...%s",result))
  
      result = driver(74, 564859072962)
      print(string.format("TEST-7...%s",result))
  
      result = driver(69, 94143178827)
      print(string.format("TEST-8...%s",result))
  
      result = driver(3, 2)
      print(string.format("TEST-9...%s",result))
  
  end
  
  main()
question_info.entry_cls_name: Solution
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.extension: lua
question_info.entry_fn_name: dynamic_programming_set_36_cut_a_rope_to_maximize_product_1
question_info.test_case_ids: 0 1 2 3 4 5 6 7 8 9
question_info.commands: lua __FILENAME__