Discription
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
题意
求n的最大质因子的位置
AC代码
#include<bits/stdc++.h>
using namespace std;
const int N = 1000000 + 5;
int prime[N],pos[N],tot=1;//prime[i]表示i是不是质数
void init()
{
//tot=1;
for(int i = 2; i< N; i ++) //判断改成i*i<N
{
if(prime[i]==0)
{
pos[i]=tot++;
for(int j = i; j < N; j += i) //从i*i开始就可以了
prime[j] = i;
}
}
}
int main()
{
int n;
init();
while(~scanf("%d",&n))
{
if(n==0)
printf("0\n");
else
printf("%d\n",pos[prime[n]]);
}
return 0;
}