十九、Largest prime factor

Problem Description
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<cstdio>using namespace std;#define max 1000001int a[max ];int main(){    int n,i,j,count=0;    a[1]=0;    for(i=2;i<max;i++)    {        if(a[i]==0)        {            count++;            for(j=i;j<max;j+=i)                a[j]=count;        }    }    while(scanf("%d",&n)!=EOF) //这里很奇怪 我使用cin>>n 就通过不了；显示超时    {       cout<<a[n]<<endl;    }    return 0;}