title: Hardy Ramanujan Theorem
signature: int hardyRamanujanTheorem(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(99, 2); 
      cout << "TEST-" << 0 << "..."
           <<  result
           << "\n";
  
      result = driver(33, 2); 
      cout << "TEST-" << 1 << "..."
           <<  result
           << "\n";
  
      result = driver(50, 2); 
      cout << "TEST-" << 2 << "..."
           <<  result
           << "\n";
  
      result = driver(17, 1); 
      cout << "TEST-" << 3 << "..."
           <<  result
           << "\n";
  
      result = driver(18, 2); 
      cout << "TEST-" << 4 << "..."
           <<  result
           << "\n";
  
      result = driver(69, 2); 
      cout << "TEST-" << 5 << "..."
           <<  result
           << "\n";
  
      result = driver(23, 1); 
      cout << "TEST-" << 6 << "..."
           <<  result
           << "\n";
  
      result = driver(18, 2); 
      cout << "TEST-" << 7 << "..."
           <<  result
           << "\n";
  
      result = driver(94, 2); 
      cout << "TEST-" << 8 << "..."
           <<  result
           << "\n";
  
      result = driver(16, 1); 
      cout << "TEST-" << 9 << "..."
           <<  result
           << "\n";
  
      return 0;
  }
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;
  }