LightOj 1028.cpp

/*
 Problem name : 1028 - Trailing Zeroes (I)
 Algorithm : Prime Facto
 Contest/Practice : Off Line Practice
 Source : Light Oj
 Comment : Whenever you start to believe  yourself, people also start to believe in you
 Date : 28-Jan-15
 Last Update : 27-Jan-2015
*/

/*
" You say you love rain, but you use an umbrella to walk under it.
  You say you love sun, but you seek shelter when it is shining.
  You say you love wind, but when it comes you close your windows.
  So that's why I'm scared when you say you love me."
                                                    ~ Bob Marley
*/

#include<bits/stdc++.h>

#define pause           system("pause");
#define FOR(s,e,inc)    for(int i=s;i<=e;i+=inc)
#define mod             1000000007
#define inf             1<<30
#define pb              push_back
#define ppb             pop_back
#define mp              make_pair
#define F               first
#define S               second
#define sz(x)           ((int)x.size())
#define sqr(x)          ( (x)* (x) )
#define eps             1e-9
#define lcm(x,y)        (abs(x) /gcd(x,y))* abs(y)
#define on(x,w)         x|(1<<w)
#define check(x,w)      (x&(1<<w))
#define all(x)          (x).begin(),(x).end()
#define pf              printf
#define pi              acos(-1.0)
#define reset(x,v)      memset(x,v,sizeof(x));
#define AND             &&
#define OR              ||
#define what_is(x)      cerr<<#x<<" is "<<x<<"\n";

typedef long long ll;
typedef unsigned long long llu;

using namespace std;


template<class T>
inline T mod_v(T num)
{
    if(num>=0)
        return num%mod;
    else
        return (num%mod+mod)%mod;
}
template<class T>
inline T gcd(T a,T b)
{
    a=abs(a);
    b=abs(b);

    while(b)
    {
        a=a%b;
        swap(a,b);
    }

    return a;
}

template<class T>
T fast_pow(T n , T p)
{
    if(p==0) return 1;
    if(p%2)
    {
        T g=mod_v ( mod_v(n) * mod_v(fast_pow(n,p-1)) );
        return g;
    }
    else
    {
        T g=fast_pow(n,p/2);
        g=mod_v( mod_v(g) * mod_v(g) ) ;
        return g;
    }
}

template<class T>
inline T modInverse(T n)
{
    return fast_pow(n,mod-2);
}

template<class T>
inline void debug(string S1,T S2,string S3)
{
    cout<<S1<<S2<<S3;
}

template<class T>
inline T in()
{
    register char c=0;
    register T num=0;
    bool n=false;
    while(c<33)c=getchar();
    while(c>33){
        if(c=='-')
            n=true;
        else num=num*10+c-'0';
        c=getchar();
    }
    return n?-num:num;
}

/*...... ! Code start from here ! ......*/

#define Max 1000000
int isprime[Max/32+10];
vector<int>prime;

inline void bit_wise_sieve()
{
    reset(isprime,0);

    for(int i=2;i<=Max;i++)
    {
        if( (isprime[i/32]&(1<<(i%32)) )==0)
        {
            prime.pb(i);
            for(int j=2;(ll) i*(ll) j<=(ll)Max;j++)
            {
                isprime[(i*j)/32]=(isprime[(i*j)/32]|(1<<((i*j) %32)) );
            }
        }
    }

}


int main()
{
//    std::ios_base::sync_with_stdio(false);

    #ifndef ONLINE_JUDGE
//        freopen ( "in.txt", "r", stdin );
    #endif

    int t,tcase=1;
    int c,x,k;
    ll now,ls;
    t=in<int>();

    bit_wise_sieve();

    while(t--)
    {
        now=in<ll>();
        x=1;
        c=k=0;

        ls=sqrt(now);

        while(now>1 && k<sz(prime) && (ll)prime[k]<=ls )
        {
            if(now% (ll)prime[k]==0)
            {
                now/= (ll)prime[k];
                c++;

            }
            else
            {
                ls=sqrt(now);
                x*=(c+1);
                c=0;
                k++;
            }//what_is(prime[k] )what_is(c);what_is(now)pause
        }
        if(c>0)
            x*=(c+1);
        if(now>1)
            x*=2;
        x--;

        printf("Case %d: %d\n",tcase++,x);


    }


    return 0;
}