title: Count Trailing Zeroes Factorial Number
signature: pub fn count_trailing_zeroes_factorial_number(n: 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(n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        9, 
        1
      ));
      
      println!("TEST-1...{}", driver(
        43, 
        9
      ));
      
      println!("TEST-2...{}", driver(
        50, 
        12
      ));
      
      println!("TEST-3...{}", driver(
        32, 
        7
      ));
      
      println!("TEST-4...{}", driver(
        37, 
        8
      ));
      
      println!("TEST-5...{}", driver(
        51, 
        12
      ));
      
      println!("TEST-6...{}", driver(
        33, 
        7
      ));
      
      println!("TEST-7...{}", driver(
        49, 
        10
      ));
      
      println!("TEST-8...{}", driver(
        1, 
        0
      ));
      
      println!("TEST-9...{}", driver(
        75, 
        18
      ));
      
  }
source_py: def count_trailing_zeroes_factorial_number(n):
      count = 0
      i = 5
      while ((n / i) >= 1):
          count += int((n / i))
          i *= 5
      return int(count)
source_cpp: int count_trailing_zeroes_factorial_number(int n) {
    int count = 0;
    for ( int i = 5;
    n / i >= 1;
    i *= 5 ) count += n / i;
    return count;
  }