title: Dynamic Programming Set 36 Cut A Rope To Maximize Product 1
signature: dynamicProgrammingSet36CutARopeToMaximizeProduct1 :: Integer -> Integer
  dynamicProgrammingSet36CutARopeToMaximizeProduct1 n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> String
  driver n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (62) (6973568802) )
  
      printf "TEST-1...%s\n" (driver (53) (258280326) )
  
      printf "TEST-2...%s\n" (driver (8) (18) )
  
      printf "TEST-3...%s\n" (driver (6) (9) )
  
      printf "TEST-4...%s\n" (driver (35) (354294) )
  
      printf "TEST-5...%s\n" (driver (35) (354294) )
  
      printf "TEST-6...%s\n" (driver (46) (19131876) )
  
      printf "TEST-7...%s\n" (driver (74) (564859072962) )
  
      printf "TEST-8...%s\n" (driver (69) (94143178827) )
  
      printf "TEST-9...%s\n" (driver (3) (2) )
  
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 );
  }