title: Dynamic Programming Set 36 Cut A Rope To Maximize Product 1
signature: long long dynamicProgrammingSet36CutARopeToMaximizeProduct1(int n) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(long long actual, long long expected){
      return actual == expected;
  }
  
  string driver(int n, long long expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(62, 6973568802); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(53, 258280326); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(8, 18); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(6, 9); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(35, 354294); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(35, 354294); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(46, 19131876); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(74, 564859072962); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(69, 94143178827); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(3, 2); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
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 );
  }