title: Count Trailing Zeroes Factorial Number
signature: countTrailingZeroesFactorialNumber :: Integer -> Integer
  countTrailingZeroesFactorialNumber n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> String
  driver n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (9) (1) )
  
      printf "TEST-1...%s\n" (driver (43) (9) )
  
      printf "TEST-2...%s\n" (driver (50) (12) )
  
      printf "TEST-3...%s\n" (driver (32) (7) )
  
      printf "TEST-4...%s\n" (driver (37) (8) )
  
      printf "TEST-5...%s\n" (driver (51) (12) )
  
      printf "TEST-6...%s\n" (driver (33) (7) )
  
      printf "TEST-7...%s\n" (driver (49) (10) )
  
      printf "TEST-8...%s\n" (driver (1) (0) )
  
      printf "TEST-9...%s\n" (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;
  }