title: Hardy Ramanujan Theorem
signature: func hardyRamanujanTheorem(n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(99, 2)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(33, 2)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(50, 2)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(17, 1)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(18, 2)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(69, 2)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(23, 1)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(18, 2)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(94, 2)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(16, 1)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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;
  }