title: Composite Number
signature: pub fn composite_number(n: i32) -> bool {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: bool, expected: bool)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, expected: bool)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        62, 
        true
      ));
      
      println!("TEST-1...{}", driver(
        13, 
        false
      ));
      
      println!("TEST-2...{}", driver(
        29, 
        false
      ));
      
      println!("TEST-3...{}", driver(
        72, 
        true
      ));
      
      println!("TEST-4...{}", driver(
        30, 
        true
      ));
      
      println!("TEST-5...{}", driver(
        20, 
        true
      ));
      
      println!("TEST-6...{}", driver(
        10, 
        true
      ));
      
      println!("TEST-7...{}", driver(
        47, 
        false
      ));
      
      println!("TEST-8...{}", driver(
        91, 
        true
      ));
      
      println!("TEST-9...{}", driver(
        52, 
        true
      ));
      
  }
source_py: def composite_number(n):
      if (n <= 1):
          return False
      if (n <= 3):
          return False
      if (((n % 2) == 0) or ((n % 3) == 0)):
          return True
      i = 5
      while ((i * i) <= n):
          if (((n % i) == 0) or ((n % (i + 2)) == 0)):
              return True
          i = (i + 6)
      return False
source_cpp: bool composite_number(int n) {
    if ( n <= 1 ) return false;
    if ( n <= 3 ) return false;
    if ( n % 2 == 0 || n % 3 == 0 ) return true;
    for ( int i = 5;
    i * i <= n;
    i = i + 6 ) if ( n % i == 0 || n % ( i + 2 ) == 0 ) return true;
    return false;
  }