title: Hardy Ramanujan Theorem
signature: pub fn hardy_ramanujan_theorem(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(
        99, 
        2
      ));
      
      println!("TEST-1...{}", driver(
        33, 
        2
      ));
      
      println!("TEST-2...{}", driver(
        50, 
        2
      ));
      
      println!("TEST-3...{}", driver(
        17, 
        1
      ));
      
      println!("TEST-4...{}", driver(
        18, 
        2
      ));
      
      println!("TEST-5...{}", driver(
        69, 
        2
      ));
      
      println!("TEST-6...{}", driver(
        23, 
        1
      ));
      
      println!("TEST-7...{}", driver(
        18, 
        2
      ));
      
      println!("TEST-8...{}", driver(
        94, 
        2
      ));
      
      println!("TEST-9...{}", driver(
        16, 
        1
      ));
      
  }
source_py: def hardy_ramanujan_theorem(n):
      count = 0
      if ((n % 2) == 0):
          count = (count + 1)
          while ((n % 2) == 0):
              n = int((n / 2))
      i = 3
      while (i <= int(math.sqrt(n))):
          if ((n % i) == 0):
              count = (count + 1)
              while ((n % i) == 0):
                  n = int((n / i))
          i = (i + 2)
      if (n > 2):
          count = (count + 1)
      return count
source_cpp: int hardy_ramanujan_theorem(int n) {
    int count = 0;
    if ( n % 2 == 0 ) {
      count ++;
      while ( n % 2 == 0 ) n = n / 2;
    }
    for ( int i = 3;
    i <= sqrt ( n );
    i = i + 2 ) {
      if ( n % i == 0 ) {
        count ++;
        while ( n % i == 0 ) n = n / i;
      }
    }
    if ( n > 2 ) count ++;
    return count;
  }