正整數分解質數個數算法c實現

#include <stdio.h>

int splitPrim(int n)
{
    int count = 0, i;

    for (i = 2; i*i <= n; i++) {
         if (n % i == 0) {
             while (n % i == 0) {
                 count++;
                 n /= i;
             }
         }
    }
    if (n > 1)
        count++;
    printf("%d\n", count);

    return count;
}

int main(int argc, char* argv[])
{
    int n;

    while (scanf("%d", &n) != EOF) {
        splitPrim(n);
    }
    return 0;
}