title: Hardy Ramanujan Theorem
signature: hardy_ramanujan_theorem <- function(n) {
test_code: 
  
  
  # SOLUTION CODE
  # ============================================
  PLACEHOLDER_CODE_BODY
  
  # TESTING CODE 
  # ============================================
  validate_solution <- function(actual, expected) {
      toString(actual)==toString(expected)
  }
  
  driver <- function(n, expected){
      if (validate_solution(PLACEHOLDER_FN_NAME(n), expected)){
          "PASSED"
      } else{
          "FAILED"
      }
  }
  
  main <- function() {
      cat(sprintf("TEST-0...%s\n",driver(
          99L, 
          2L
      )))
  
      cat(sprintf("TEST-1...%s\n",driver(
          33L, 
          2L
      )))
  
      cat(sprintf("TEST-2...%s\n",driver(
          50L, 
          2L
      )))
  
      cat(sprintf("TEST-3...%s\n",driver(
          17L, 
          1L
      )))
  
      cat(sprintf("TEST-4...%s\n",driver(
          18L, 
          2L
      )))
  
      cat(sprintf("TEST-5...%s\n",driver(
          69L, 
          2L
      )))
  
      cat(sprintf("TEST-6...%s\n",driver(
          23L, 
          1L
      )))
  
      cat(sprintf("TEST-7...%s\n",driver(
          18L, 
          2L
      )))
  
      cat(sprintf("TEST-8...%s\n",driver(
          94L, 
          2L
      )))
  
      cat(sprintf("TEST-9...%s\n",driver(
          16L, 
          1L
      )))
  
  }
  
  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;
  }