本文共 567 字，大约阅读时间需要 1 分钟。

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

12345

Sample Output

01213

#include 
   
    #include 
    
     #include 
     
      using namespace std;const int maxn=1000000+10;int p[maxn];int a[maxn];int cnt=1;void init(){    for(int i=2;i
      
       >n)    {        cout<
       
        <
       
      
     
    
   

 

转载地址：http://npyzi.baihongyu.com/