title: Sum Divisors 1 N 1
signature: sumDivisors1N1 :: Integer -> Integer
  sumDivisors1N1 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 (73) (4406) )
  
      printf "TEST-1...%s\n" (driver (41) (1384) )
  
      printf "TEST-2...%s\n" (driver (36) (1098) )
  
      printf "TEST-3...%s\n" (driver (28) (660) )
  
      printf "TEST-4...%s\n" (driver (49) (1987) )
  
      printf "TEST-5...%s\n" (driver (24) (491) )
  
      printf "TEST-6...%s\n" (driver (85) (5977) )
  
      printf "TEST-7...%s\n" (driver (59) (2846) )
  
      printf "TEST-8...%s\n" (driver (82) (5561) )
  
      printf "TEST-9...%s\n" (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;
  }