title: Count Factorial Numbers In A Given Range
signature: fun countFactorialNumbersInAGivenRange(low: Int, high: Int): Int {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Int, expected:Int):Boolean{
    return actual.equals(expected)
  }
  fun driver(low: Int, high: Int, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(low, high), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(57, 79, 0)
      println("TEST-0...${result}")
      
      result = driver(57, 21, 0)
      println("TEST-1...${result}")
      
      result = driver(31, 37, 0)
      println("TEST-2...${result}")
      
      result = driver(62, 87, 0)
      println("TEST-3...${result}")
      
      result = driver(49, 98, 0)
      println("TEST-4...${result}")
      
      result = driver(82, 76, 0)
      println("TEST-5...${result}")
      
      result = driver(31, 45, 0)
      println("TEST-6...${result}")
      
      result = driver(5, 52, 2)
      println("TEST-7...${result}")
      
      result = driver(76, 43, 0)
      println("TEST-8...${result}")
      
      result = driver(55, 6, 0)
      println("TEST-9...${result}")
      
          
  }
  
  main()
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;
  }