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.
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<stdio.h>
#include<string.h>
#include<math.h>
#define maxn 1000000
#define LL long long
bool notprime[maxn+10];
int posprime[maxn+10];
void Era()
{
notprime[1]=true;
int cnt=0;
for(int i=2;i<maxn;i++)
{
if(!notprime[i])
{
posprime[i]=++cnt;
for(int j=i;j<maxn;j+=i)
{
notprime[j]=true;
posprime[j]=cnt;
}
}
}
}
int judge(int n)
{
if(n==1)
return 0;
else
return posprime[n];
}
int main()
{
int n;
Era();
while(scanf("%d",&n)!=EOF)
{
printf("%d\n",judge(n));
}
return 0;
}