参考题解
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
bool isPrime(int n) {
if (n <= 1) return false;
for (int i = 2; i* i <= n; i++) {
if (n % i == 0) return false;
}
return true;
}
int main() {
int N;
while (cin >> N) {
int sum = 0;
for (int i = 2; i * i <= N; i++) {
while (N % i == 0) {
N = N / i;
sum ++;
}
}
if (isPrime(N)) sum++;
cout << sum << endl;
}
return 0;
}