UVa 10699 - Count the factors Solution

#include<iostream>
#include<list>
#include<string>
#include<cstring>
#include<sstream>
#include<cctype>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<stack>
#include<fstream>
#include<cstdlib>
#include<vector>
#include<map>
#include<set>
#include<utility>
#include<iomanip>
#include<queue>

using namespace std;

#define INF (1<<29)
#define SET(a) memset(a,-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define CLR(a) memset(a,0,sizeof(a))
#define FILL(a,v) memset(a,v,sizeof(a))
#define PB push_back
#define FOR(i,n) for(int i = 0;i<n;i++)
#define PI acos(-1.0)
#define EPS 1e-9
#define MP(a,b) make_pair(a,b)
#define min3(a,b,c) min(a,min(b,c))
#define max3(a,b,c) max(a,max(b,c))
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
#define LL long long
#define MX 1000005
#define MOD 1000000007


bool stats[MX+10];
vector<long>prime;
long N,n,primeSize,cnt;
//map<long, long>factor;

void PrimeGenerate()
{
    long i,j,sqrtN;

    for(i=4;i<=MX;i+=2)
        stats[i]=true;

    sqrtN=sqrt(MX);

    for(i=3;i<=sqrtN;i+=2)
    {
        if(!stats[i])
            for(j=i*i;j<=MX;j+=i+i)
                stats[j]=true;
    }

    for(i=2;i<=MX;i++)
        if(!stats[i])
            prime.PB(i);

    primeSize=prime.size();
}


void PrimeFactorize()
{
    long i;
    cnt=0;

    for(i=0;i<primeSize;i++)
    {
        if(n%prime[i]==0)
        {
            //factor[cnt]=prime[i];
            cnt++;

            while(n%prime[i]==0)
                n/=prime[i];
        }

        if(n==1)    break;
    }
}


int main()
{
   //long result;
   PrimeGenerate();
   while(cin>>n)
   {
       if(n==0) break;
       if(n==1)
       {
           cout<<"0"<<endl;
           continue;
       }
       N=n;
       PrimeFactorize();
       cout<<N<<" : "<<cnt<<endl;
   }
return 0;
}