[UVa] 10699 - Count the Factors

It's a slight modification of the code I used for 583. Simple enough.

#include <stdio.h>
#include <math.h>
#include <string.h>
int primes[7000];
bool marks[60000];


int sieve2(int n)
{

    int i, j, k;

    memset(marks,true,n);

    marks[0] = marks[1] = false;

    for (i=4 ; i<n ; i+=2)
        marks[i]=false;

    for (i=3 ; i*i<n ; i+=2)
    {
        if (marks[i]==true)
        {
            for (j=i*i ; j<n ; j+=(2*i))
                marks[j]=false;
        }

    }

    for (i=2, j=0 ; i<=n ; i++)
    {
        if (marks[i]==true)
        {
            primes[j++]=i;
        }
    }

    return j-1;

}

int main() {

    int i, j, kounter=0, q;
    int mark=sieve2(50000);


    while (scanf("%d",&q) && q)
    {

        kounter=0;

        printf("%d : ",q);

        for (j=0 ; primes[j]<q && j<mark ; j++)
        {
            if (q%primes[j]==0) kounter++;
            while (q%primes[j]==0)
            {
                q/=primes[j];
            }
        }

        if (q>1)
            kounter++;

        printf("%d\n",kounter);
    }
    return 0;
}