title: Count Factorial Numbers In A Given Range
signature: countFactorialNumbersInAGivenRange :: Integer -> Integer -> Integer
  countFactorialNumbersInAGivenRange low high = 
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 -> Integer -> String
  driver low high expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME low high) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (57) (79) (0) )
  
      printf "TEST-1...%s\n" (driver (57) (21) (0) )
  
      printf "TEST-2...%s\n" (driver (31) (37) (0) )
  
      printf "TEST-3...%s\n" (driver (62) (87) (0) )
  
      printf "TEST-4...%s\n" (driver (49) (98) (0) )
  
      printf "TEST-5...%s\n" (driver (82) (76) (0) )
  
      printf "TEST-6...%s\n" (driver (31) (45) (0) )
  
      printf "TEST-7...%s\n" (driver (5) (52) (2) )
  
      printf "TEST-8...%s\n" (driver (76) (43) (0) )
  
      printf "TEST-9...%s\n" (driver (55) (6) (0) )
  
source_py: def count_factorial_numbers_in_a_given_range(low, high):
      fact = 1
      x = 1
      while (fact < low):
          fact = (fact * x)
          x += 1
      res = 0
      while (fact <= high):
          res += 1
          fact = (fact * x)
          x += 1
      return res
source_cpp: int count_factorial_numbers_in_a_given_range(int low, int high) {
    int fact = 1, x = 1;
    while ( fact < low ) {
      fact = fact * x;
      x ++;
    }
    int res = 0;
    while ( fact <= high ) {
      res ++;
      fact = fact * x;
      x ++;
    }
    return res;
  }