title: Count Trailing Zeroes Factorial Number
signature: func countTrailingZeroesFactorialNumber(n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(9, 1)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(43, 9)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(50, 12)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(32, 7)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(37, 8)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(51, 12)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(33, 7)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(49, 10)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(1, 0)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(75, 18)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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;
  }