title: Count Digits Factorial Set 1
signature: class Solution {
  
      public Integer countDigitsFactorialSet1(Integer n) {
test_code: import static java.util.Map.entry;  
  import java.util.*;
  import java.lang.*;
  // TESTING CODE 
  // ============================================
  class QuestionEvaluator {
      public static String validateSolution(Integer n, Integer expected){
          try{
              Driver driver = new Driver();
              if (driver.run(n,expected)){
                  return "PASSED";
              }
              return "FAILED";
              
          } catch (Exception exception_obj){
              return exception_obj.getClass().getSimpleName();
          }
  
      }
      public static void main(String[] args) {
          String result;
          result = validateSolution(66, 93);
          System.out.println(String.format("%s%s","TEST-0...",result));    
      
          result = validateSolution(7, 4);
          System.out.println(String.format("%s%s","TEST-1...",result));    
      
          result = validateSolution(55, 74);
          System.out.println(String.format("%s%s","TEST-2...",result));    
      
          result = validateSolution(37, 44);
          System.out.println(String.format("%s%s","TEST-3...",result));    
      
          result = validateSolution(76, 112);
          System.out.println(String.format("%s%s","TEST-4...",result));    
      
          result = validateSolution(16, 14);
          System.out.println(String.format("%s%s","TEST-5...",result));    
      
          result = validateSolution(17, 15);
          System.out.println(String.format("%s%s","TEST-6...",result));    
      
          result = validateSolution(95, 149);
          System.out.println(String.format("%s%s","TEST-7...",result));    
      
          result = validateSolution(71, 102);
          System.out.println(String.format("%s%s","TEST-8...",result));    
      
          result = validateSolution(90, 139);
          System.out.println(String.format("%s%s","TEST-9...",result));    
      
      }
  }
  
  class Driver{
      public boolean run(Integer n, Integer expected){
  
          PLACEHOLDER_CLS_NAME sol = new PLACEHOLDER_CLS_NAME();
          return validateSolution(sol.PLACEHOLDER_FN_NAME(n),expected);
      }
      
      public boolean validateSolution(Integer actual, Integer expected){
          return actual.equals(expected);
      }
  }
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
source_py: def count_digits_factorial_set_1(n):
      if (n < 0):
          return 0
      if (n <= 1):
          return 1
      digits = 0
      for i in range(2, (n + 1)):
          digits += math.log10(i)
      return (math.floor(digits) + 1)
source_cpp: int count_digits_factorial_set_1(int n) {
    if ( n < 0 ) return 0;
    if ( n <= 1 ) return 1;
    double digits = 0;
    for ( int i = 2;
    i <= n;
    i ++ ) digits += log10 ( i );
    return floor ( digits ) + 1;
  }