title: Find First Natural Number Whose Factorial Divisible X
signature: int findFirstNaturalNumberWhoseFactorialDivisibleX(int x) {
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(int actual, int expected){
      return actual == expected;
  }
  
  string driver(int x, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(x), 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(67, 66); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(47, 46); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(57, 19); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(89, 88); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(67, 66); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(40, 5); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(16, 6); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(83, 82); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(93, 31); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(43, 42); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
source_py: def find_first_natural_number_whose_factorial_divisible_x(x):
      i = 1
      fact = 1
      for i in range(1, x):
          fact = (fact * i)
          if ((fact % x) == 0):
              break
      return i
source_cpp: int find_first_natural_number_whose_factorial_divisible_x(int x) {
    int i = 1;
    int fact = 1;
    for ( i = 1;
    i < x;
    i ++ ) {
      fact = fact * i;
      if ( fact % x == 0 ) break;
    }
    return i;
  }