Largest prime factor
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7347 Accepted Submission(s): 2610
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>
int a[1000001];
int main()
{
int flag=0,i,j,n;
memset(a,0,sizeof(a));//标记为0
a[1]=0;//题目说的特殊情况
for (i=2;i<1000000;i++)
{//从第二个开始
if (a[i]==0)//如果没有被标记
{
flag++;//flag就加一
a[i]=flag;
for (j=i+i;j<1000000;j+=i)
{
a[j]=flag;//然后i的倍数都要被flag上,恩,这是最主要的!
}
}
}
while (scanf("%d",&n)!=EOF)
{
printf("%d\n",a[n]);
}
}