title: Count Trailing Zeroes Factorial Number
signature: fun countTrailingZeroesFactorialNumber(n: Int): Int {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Int, expected:Int):Boolean{
    return actual.equals(expected)
  }
  fun driver(n: Int, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(9, 1)
      println("TEST-0...${result}")
      
      result = driver(43, 9)
      println("TEST-1...${result}")
      
      result = driver(50, 12)
      println("TEST-2...${result}")
      
      result = driver(32, 7)
      println("TEST-3...${result}")
      
      result = driver(37, 8)
      println("TEST-4...${result}")
      
      result = driver(51, 12)
      println("TEST-5...${result}")
      
      result = driver(33, 7)
      println("TEST-6...${result}")
      
      result = driver(49, 10)
      println("TEST-7...${result}")
      
      result = driver(1, 0)
      println("TEST-8...${result}")
      
      result = driver(75, 18)
      println("TEST-9...${result}")
      
          
  }
  
  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;
  }