title: Sum Divisors 1 N 1
signature: sumDivisors1N1(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          73, 
          4406)
      }");
  
      print("TEST-1...${driver(
          41, 
          1384)
      }");
  
      print("TEST-2...${driver(
          36, 
          1098)
      }");
  
      print("TEST-3...${driver(
          28, 
          660)
      }");
  
      print("TEST-4...${driver(
          49, 
          1987)
      }");
  
      print("TEST-5...${driver(
          24, 
          491)
      }");
  
      print("TEST-6...${driver(
          85, 
          5977)
      }");
  
      print("TEST-7...${driver(
          59, 
          2846)
      }");
  
      print("TEST-8...${driver(
          82, 
          5561)
      }");
  
      print("TEST-9...${driver(
          40, 
          1342)
      }");
  
      return 0;
  }
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;
  }