title: Prime Numbers
signature: primeNumbers(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(bool actual, bool expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, bool 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(
          2, 
          true)
      }");
  
      print("TEST-1...${driver(
          74, 
          false)
      }");
  
      print("TEST-2...${driver(
          46, 
          false)
      }");
  
      print("TEST-3...${driver(
          38, 
          false)
      }");
  
      print("TEST-4...${driver(
          51, 
          false)
      }");
  
      print("TEST-5...${driver(
          48, 
          false)
      }");
  
      print("TEST-6...${driver(
          6, 
          false)
      }");
  
      print("TEST-7...${driver(
          14, 
          false)
      }");
  
      print("TEST-8...${driver(
          31, 
          true)
      }");
  
      print("TEST-9...${driver(
          10, 
          false)
      }");
  
      return 0;
  }
source_py: def prime_numbers(n):
      if (n <= 1):
          return False
      for i in range(2, n):
          if ((n % i) == 0):
              return False
      return True
source_cpp: bool prime_numbers(int n) {
    if ( n <= 1 ) return false;
    for ( int i = 2;
    i < n;
    i ++ ) if ( n % i == 0 ) return false;
    return true;
  }