title: Hardy Ramanujan Theorem
signature: def hardyRamanujanTheorem(n: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Int , expected: Int): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(n: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        99, 
        2    
      )}")   
  
  
      println(s"TEST-1...${driver(
        33, 
        2    
      )}")   
  
  
      println(s"TEST-2...${driver(
        50, 
        2    
      )}")   
  
  
      println(s"TEST-3...${driver(
        17, 
        1    
      )}")   
  
  
      println(s"TEST-4...${driver(
        18, 
        2    
      )}")   
  
  
      println(s"TEST-5...${driver(
        69, 
        2    
      )}")   
  
  
      println(s"TEST-6...${driver(
        23, 
        1    
      )}")   
  
  
      println(s"TEST-7...${driver(
        18, 
        2    
      )}")   
  
  
      println(s"TEST-8...${driver(
        94, 
        2    
      )}")   
  
  
      println(s"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;
  }