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

采用素数筛选法：即先将2的倍数全置1，然后将3的倍数置2，……

#include<iostream>
using namespace std;
#define N 1000001
int prime[N];
int main()
 {
      for(int j=0;j<N;j++)
         prime[j]=-1;
      int num=0;
      for(int i=2; i<N; i++)
      {
        if(prime[i]==-1)
         {
            num++;
            for(int j=i;j<N;j+=i) 
               prime[j]=num;
         }
      }
      int n;   
   while(scanf("%d",&n)!=EOF)
       { 
           if(n==1)
           cout<<"0"<<endl;
           else 
          cout<<prime[n]<<endl;
       } 
   return 0;
 }