title: Find First Natural Number Whose Factorial Divisible X
signature: pub fn find_first_natural_number_whose_factorial_divisible_x(x: i32) -> i32 {
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: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(x: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(x), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        67, 
        66
      ));
      
      println!("TEST-1...{}", driver(
        47, 
        46
      ));
      
      println!("TEST-2...{}", driver(
        57, 
        19
      ));
      
      println!("TEST-3...{}", driver(
        89, 
        88
      ));
      
      println!("TEST-4...{}", driver(
        67, 
        66
      ));
      
      println!("TEST-5...{}", driver(
        40, 
        5
      ));
      
      println!("TEST-6...{}", driver(
        16, 
        6
      ));
      
      println!("TEST-7...{}", driver(
        83, 
        82
      ));
      
      println!("TEST-8...{}", driver(
        93, 
        31
      ));
      
      println!("TEST-9...{}", driver(
        43, 
        42
      ));
      
  }
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;
  }