title: Count Trailing Zeroes Factorial Number
signature: function count_trailing_zeroes_factorial_number(n)
test_code: using Printf
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  function validate_solution(actual, expected)
      return actual == expected
  end
  
  function driver(n, expected)
      try
  
          if validate_solution(PLACEHOLDER_FN_NAME(n), expected)
              return "PASSED";
          end
          return "FAILED";
      catch exception_obj
          return string(Base.typename(typeof(exception_obj)).wrapper);
      end
  end
  
  function main()
      
      result = driver(9, 1);
      @printf("TEST-0...%s\n",result);
      
      result = driver(43, 9);
      @printf("TEST-1...%s\n",result);
      
      result = driver(50, 12);
      @printf("TEST-2...%s\n",result);
      
      result = driver(32, 7);
      @printf("TEST-3...%s\n",result);
      
      result = driver(37, 8);
      @printf("TEST-4...%s\n",result);
      
      result = driver(51, 12);
      @printf("TEST-5...%s\n",result);
      
      result = driver(33, 7);
      @printf("TEST-6...%s\n",result);
      
      result = driver(49, 10);
      @printf("TEST-7...%s\n",result);
      
      result = driver(1, 0);
      @printf("TEST-8...%s\n",result);
      
      result = driver(75, 18);
      @printf("TEST-9...%s\n",result);
      
  end
  
  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;
  }