HDU 2136 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

Author
Wiskey

Source
HDU 2007-11 Programming Contest_WarmUp

#include <stdio.h>
using namespace std;

int a[1000000] = {0};
int main()
{
    int count = 1;                  //记录素数的位置
    for(int i = 2; i<1000000; i++)
    {
        if(a[i]==0)
        {
            a[i] = count;
            for(int j = 2; j*i<1000000; j++)
            {
                a[i*j] = count;     //将包含i的数全部赋值为count
            }
            count++;
        }
    }
    int n;
    while(~scanf("%d",&n))
    printf("%d\n",a[n]);
}