title: Dynamic Programming Set 36 Cut A Rope To Maximize Product 1
signature: class Solution {
  
      public Long dynamicProgrammingSet36CutARopeToMaximizeProduct1(Integer 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.extension: java
question_info.entry_fn_name: dynamicProgrammingSet36CutARopeToMaximizeProduct1
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.test_code: import static java.util.Map.entry;  
  import java.util.*;
  import java.lang.*;
  // TESTING CODE 
  // ============================================
  class QuestionEvaluator {
      public static String validateSolution(Integer n, Long expected){
          try{
              Driver driver = new Driver();
              if (driver.run(n,expected)){
                  return "PASSED";
              }
              return "FAILED";
              
          } catch (Exception exception_obj){
              return exception_obj.getClass().getSimpleName();
          }
  
      }
      public static void main(String[] args) {
          String result;
          result = validateSolution(62, 6973568802L);
          System.out.println(String.format("%s%s","TEST-0...",result));    
      
          result = validateSolution(53, 258280326L);
          System.out.println(String.format("%s%s","TEST-1...",result));    
      
          result = validateSolution(8, 18L);
          System.out.println(String.format("%s%s","TEST-2...",result));    
      
          result = validateSolution(6, 9L);
          System.out.println(String.format("%s%s","TEST-3...",result));    
      
          result = validateSolution(35, 354294L);
          System.out.println(String.format("%s%s","TEST-4...",result));    
      
          result = validateSolution(35, 354294L);
          System.out.println(String.format("%s%s","TEST-5...",result));    
      
          result = validateSolution(46, 19131876L);
          System.out.println(String.format("%s%s","TEST-6...",result));    
      
          result = validateSolution(74, 564859072962L);
          System.out.println(String.format("%s%s","TEST-7...",result));    
      
          result = validateSolution(69, 94143178827L);
          System.out.println(String.format("%s%s","TEST-8...",result));    
      
          result = validateSolution(3, 2L);
          System.out.println(String.format("%s%s","TEST-9...",result));    
      
      }
  }
  
  class Driver{
      public boolean run(Integer n, Long expected){
  
          PLACEHOLDER_CLS_NAME sol = new PLACEHOLDER_CLS_NAME();
          return validateSolution(sol.PLACEHOLDER_FN_NAME(n),expected);
      }
      
      public boolean validateSolution(Long actual, Long expected){
          return actual.equals(expected);
      }
  }
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
question_info.test_case_ids: 0 1 2 3 4 5 6 7 8 9
question_info.commands: java __FILENAME__