title: Count Trailing Zeroes Factorial Number
signature: function countTrailingZeroesFactorialNumber(n) {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value) {
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual, expected){
      return convertToString(actual)===convertToString(expected);
  }
  
  function driver(n, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(9, 1);
    console.log(`TEST-0...${result}`);
  
    result = driver(43, 9);
    console.log(`TEST-1...${result}`);
  
    result = driver(50, 12);
    console.log(`TEST-2...${result}`);
  
    result = driver(32, 7);
    console.log(`TEST-3...${result}`);
  
    result = driver(37, 8);
    console.log(`TEST-4...${result}`);
  
    result = driver(51, 12);
    console.log(`TEST-5...${result}`);
  
    result = driver(33, 7);
    console.log(`TEST-6...${result}`);
  
    result = driver(49, 10);
    console.log(`TEST-7...${result}`);
  
    result = driver(1, 0);
    console.log(`TEST-8...${result}`);
  
    result = driver(75, 18);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
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;
  }