title: Composite Number
signature: bool compositeNumber(int n) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(bool actual, bool expected){
      return actual == expected;
  }
  
  string driver(int n, bool expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(62, true); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(13, false); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(29, false); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(72, true); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(30, true); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(20, true); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(10, true); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(47, false); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(91, true); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(52, true); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
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;
  }