title: Count Factorial Numbers In A Given Range
signature: countFactorialNumbersInAGivenRange(low, high) {
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(low, high, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(low, high), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          57, 79, 
          0)
      }");
  
      print("TEST-1...${driver(
          57, 21, 
          0)
      }");
  
      print("TEST-2...${driver(
          31, 37, 
          0)
      }");
  
      print("TEST-3...${driver(
          62, 87, 
          0)
      }");
  
      print("TEST-4...${driver(
          49, 98, 
          0)
      }");
  
      print("TEST-5...${driver(
          82, 76, 
          0)
      }");
  
      print("TEST-6...${driver(
          31, 45, 
          0)
      }");
  
      print("TEST-7...${driver(
          5, 52, 
          2)
      }");
  
      print("TEST-8...${driver(
          76, 43, 
          0)
      }");
  
      print("TEST-9...${driver(
          55, 6, 
          0)
      }");
  
      return 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;
  }