title: Sum Divisors 1 N 1
signature: def sumDivisors1N1(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(
        73, 
        4406    
      )}")   
  
  
      println(s"TEST-1...${driver(
        41, 
        1384    
      )}")   
  
  
      println(s"TEST-2...${driver(
        36, 
        1098    
      )}")   
  
  
      println(s"TEST-3...${driver(
        28, 
        660    
      )}")   
  
  
      println(s"TEST-4...${driver(
        49, 
        1987    
      )}")   
  
  
      println(s"TEST-5...${driver(
        24, 
        491    
      )}")   
  
  
      println(s"TEST-6...${driver(
        85, 
        5977    
      )}")   
  
  
      println(s"TEST-7...${driver(
        59, 
        2846    
      )}")   
  
  
      println(s"TEST-8...${driver(
        82, 
        5561    
      )}")   
  
  
      println(s"TEST-9...${driver(
        40, 
        1342    
      )}")   
  
  }
  
source_py: def sum_divisors_1_n_1(n):
      sum = 0
      for i in range(1, (n + 1)):
          sum += (int((n / i)) * i)
      return int(sum)
source_cpp: int sum_divisors_1_n_1(int n) {
    int sum = 0;
    for ( int i = 1;
    i <= n;
    ++ i ) sum += ( n / i ) * i;
    return sum;
  }