title: Count Digits Factorial Set 2
signature: pub fn count_digits_factorial_set_2(n: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        56, 
        75
      ));
      
      println!("TEST-1...{}", driver(
        92, 
        143
      ));
      
      println!("TEST-2...{}", driver(
        52, 
        68
      ));
      
      println!("TEST-3...{}", driver(
        96, 
        150
      ));
      
      println!("TEST-4...{}", driver(
        96, 
        150
      ));
      
      println!("TEST-5...{}", driver(
        63, 
        88
      ));
      
      println!("TEST-6...{}", driver(
        51, 
        67
      ));
      
      println!("TEST-7...{}", driver(
        79, 
        117
      ));
      
      println!("TEST-8...{}", driver(
        70, 
        101
      ));
      
      println!("TEST-9...{}", driver(
        9, 
        6
      ));
      
  }
source_py: def count_digits_factorial_set_2(n):
      if (n < 0):
          return 0
      if (n <= 1):
          return 1
      x = ((n * math.log10((n / math.e))) + (math.log10(((2 * math.pi) * n)) / 2.0))
      return (math.floor(x) + 1)
source_cpp: long long count_digits_factorial_set_2(int n) {
    if ( n < 0 ) return 0;
    if ( n <= 1 ) return 1;
    double x = ( ( n * log10 ( n / M_E ) + log10 ( 2 * M_PI * n ) / 2.0 ) );
    return floor ( x ) + 1;
  }