title: Hardy Ramanujan Theorem
signature: hardyRamanujanTheorem(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          99, 
          2)
      }");
  
      print("TEST-1...${driver(
          33, 
          2)
      }");
  
      print("TEST-2...${driver(
          50, 
          2)
      }");
  
      print("TEST-3...${driver(
          17, 
          1)
      }");
  
      print("TEST-4...${driver(
          18, 
          2)
      }");
  
      print("TEST-5...${driver(
          69, 
          2)
      }");
  
      print("TEST-6...${driver(
          23, 
          1)
      }");
  
      print("TEST-7...${driver(
          18, 
          2)
      }");
  
      print("TEST-8...${driver(
          94, 
          2)
      }");
  
      print("TEST-9...${driver(
          16, 
          1)
      }");
  
      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;
  }