title: Hardy Ramanujan Theorem
signature: function hardyRamanujanTheorem(n) {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value) {
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual, expected){
      return convertToString(actual)===convertToString(expected);
  }
  
  function driver(n, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(99, 2);
    console.log(`TEST-0...${result}`);
  
    result = driver(33, 2);
    console.log(`TEST-1...${result}`);
  
    result = driver(50, 2);
    console.log(`TEST-2...${result}`);
  
    result = driver(17, 1);
    console.log(`TEST-3...${result}`);
  
    result = driver(18, 2);
    console.log(`TEST-4...${result}`);
  
    result = driver(69, 2);
    console.log(`TEST-5...${result}`);
  
    result = driver(23, 1);
    console.log(`TEST-6...${result}`);
  
    result = driver(18, 2);
    console.log(`TEST-7...${result}`);
  
    result = driver(94, 2);
    console.log(`TEST-8...${result}`);
  
    result = driver(16, 1);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
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;
  }