title: Hardy Ramanujan Theorem
signature: function hardy_ramanujan_theorem(n)
test_code: 
  
  -- SOLUTION CODE
  -- ============================================
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  function isCorrect(actual, expected)
      if type(expected) ~= type(actual) then
          return false
      end
      
      if type(expected) == 'table' then
          for k,v_expected in pairs(expected) do
              
              if actual[k] == nil then
                  return false
              end
              local v_actual = actual[k]
              if not isCorrect(v_actual, v_expected) then
                  return false
              end
              actual[k]=nil
          end
      
          if next(actual) then 
              return false
          end
          return true
      else
          return actual == expected
      end
  end
  
  function validateSolution(actual, expected)
      return isCorrect(actual,expected)
  end
  
  function driver(n, expected)
      local exec_result;
      local status, error_msg = pcall(function () 
          exec_result=PLACEHOLDER_FN_NAME(n) 
      end)
      if status then
          if validateSolution(exec_result,expected) then
              return "PASSED"
          end
          return "FAILED"
      else
          return string.format("ERROR=%s",string.gsub(error_msg,".*:[%d]+: ",""))
      end
  end
      
  function main()
      result = driver(99, 2)
      print(string.format("TEST-0...%s",result))
  
      result = driver(33, 2)
      print(string.format("TEST-1...%s",result))
  
      result = driver(50, 2)
      print(string.format("TEST-2...%s",result))
  
      result = driver(17, 1)
      print(string.format("TEST-3...%s",result))
  
      result = driver(18, 2)
      print(string.format("TEST-4...%s",result))
  
      result = driver(69, 2)
      print(string.format("TEST-5...%s",result))
  
      result = driver(23, 1)
      print(string.format("TEST-6...%s",result))
  
      result = driver(18, 2)
      print(string.format("TEST-7...%s",result))
  
      result = driver(94, 2)
      print(string.format("TEST-8...%s",result))
  
      result = driver(16, 1)
      print(string.format("TEST-9...%s",result))
  
  end
  
  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;
  }