title: Count Digits Factorial Set 1
signature: int countDigitsFactorialSet1(int n) {
test_code: #include <algorithm>
  #include <assert.h>
  #include <cstdlib>
  #include <iostream>
  #include <map>
  #include <set>
  #include <string>
  #include <tuple> 
  #include <unordered_map>
  #include <vector>
  #include <math.h>
  #include <cmath>
  #include <bits/stdc++.h>
  #include <numeric>
  #include <functional>
  
  using namespace std;
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual == expected;
  }
  
  string driver(int n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }
      catch (const std::overflow_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::runtime_error& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (const std::exception& exception_obj)
      {
          return typeid(exception_obj).name();
      }
      catch (...)
      {
          return "UNK_ERROR";
      }
  }
  
  int main() {
      string result = "";
  
      result = driver(66, 93); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(7, 4); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(55, 74); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(37, 44); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(76, 112); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(16, 14); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(17, 15); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(95, 149); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(71, 102); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(90, 139); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
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;
  }