title: Maximum Value Choice Either Dividing Considering
signature: def maximumValueChoiceEitherDividingConsidering(n: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Int , expected: Int): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(n: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        3, 
        3    
      )}")   
  
  
      println(s"TEST-1...${driver(
        19, 
        24    
      )}")   
  
  
      println(s"TEST-2...${driver(
        39, 
        57    
      )}")   
  
  
      println(s"TEST-3...${driver(
        89, 
        152    
      )}")   
  
  
      println(s"TEST-4...${driver(
        96, 
        192    
      )}")   
  
  
      println(s"TEST-5...${driver(
        68, 
        114    
      )}")   
  
  
      println(s"TEST-6...${driver(
        48, 
        83    
      )}")   
  
  
      println(s"TEST-7...${driver(
        5, 
        5    
      )}")   
  
  
      println(s"TEST-8...${driver(
        3, 
        3    
      )}")   
  
  
      println(s"TEST-9...${driver(
        4, 
        4    
      )}")   
  
  }
  
source_py: def maximum_value_choice_either_dividing_considering(n):
      res = list()
      res.append(0)
      res.append(1)
      i = 2
      while (i < (n + 1)):
          res.append(max(i, (((res[int((i / 2))] + res[int((i / 3))]) + res[int((i / 4))]) + res[int((i / 5))])))
          i = (i + 1)
      return res[n]
source_cpp: int maximum_value_choice_either_dividing_considering(int n) {
    int res [ n + 1 ];
    res [ 0 ] = 0;
    res [ 1 ] = 1;
    for ( int i = 2;
    i <= n;
    i ++ ) res [ i ] = max ( i, ( res [ i / 2 ] + res [ i / 3 ] + res [ i / 4 ] + res [ i / 5 ] ) );
    return res [ n ];
  }