title: Count Digits Factorial Set 1
signature: fun countDigitsFactorialSet1(n: 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(n: Int, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(66, 93)
      println("TEST-0...${result}")
      
      result = driver(7, 4)
      println("TEST-1...${result}")
      
      result = driver(55, 74)
      println("TEST-2...${result}")
      
      result = driver(37, 44)
      println("TEST-3...${result}")
      
      result = driver(76, 112)
      println("TEST-4...${result}")
      
      result = driver(16, 14)
      println("TEST-5...${result}")
      
      result = driver(17, 15)
      println("TEST-6...${result}")
      
      result = driver(95, 149)
      println("TEST-7...${result}")
      
      result = driver(71, 102)
      println("TEST-8...${result}")
      
      result = driver(90, 139)
      println("TEST-9...${result}")
      
          
  }
  
  main()
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;
  }