title: Count Trailing Zeroes Factorial Number
signature: countTrailingZeroesFactorialNumber(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          9, 
          1)
      }");
  
      print("TEST-1...${driver(
          43, 
          9)
      }");
  
      print("TEST-2...${driver(
          50, 
          12)
      }");
  
      print("TEST-3...${driver(
          32, 
          7)
      }");
  
      print("TEST-4...${driver(
          37, 
          8)
      }");
  
      print("TEST-5...${driver(
          51, 
          12)
      }");
  
      print("TEST-6...${driver(
          33, 
          7)
      }");
  
      print("TEST-7...${driver(
          49, 
          10)
      }");
  
      print("TEST-8...${driver(
          1, 
          0)
      }");
  
      print("TEST-9...${driver(
          75, 
          18)
      }");
  
      return 0;
  }
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;
  }