title: Composite Number
signature: fun compositeNumber(n: Int): Boolean {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Boolean, expected:Boolean):Boolean{
    return actual.equals(expected)
  }
  fun driver(n: Int, expected:Boolean):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(62, true)
      println("TEST-0...${result}")
      
      result = driver(13, false)
      println("TEST-1...${result}")
      
      result = driver(29, false)
      println("TEST-2...${result}")
      
      result = driver(72, true)
      println("TEST-3...${result}")
      
      result = driver(30, true)
      println("TEST-4...${result}")
      
      result = driver(20, true)
      println("TEST-5...${result}")
      
      result = driver(10, true)
      println("TEST-6...${result}")
      
      result = driver(47, false)
      println("TEST-7...${result}")
      
      result = driver(91, true)
      println("TEST-8...${result}")
      
      result = driver(52, true)
      println("TEST-9...${result}")
      
          
  }
  
  main()
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;
  }