求素数的位置

Everybody knows any number can be combined by the prime number. 
Now, your task is telling me what position of the largest prime factor. 
The position of prime 2 is 1, prime 3 is 2, and prime 5 is 3, etc. 
Specially, LPF(1) = 0. 

Input

Each line will contain one integer n(0 < n < 1000000). 

Output

Output the LPF(n). 

Sample Input

1
2
3
4
5

Sample Output

0
1
2
1
3

#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=1000000+10;
int p[maxn];
int a[maxn];
int cnt=1;
void init()
{
    for(int i=2;i<maxn;i++)
    {
        if(p[i]==0)
        {
            a[i]=cnt++;
            for(int j=i;j<maxn;j+=i)
            p[j]=i;
        }
    }
}
int main()
{
    int n;
    ios::sync_with_stdio(false);
    init();
    while(cin>>n)
    {
        cout<<a[p[n]]<<endl;
    }
    return 0;
}