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
#define N 1000000
int p[N];
int main()
{
int i, j, n, k;
k = 1;
p[1] = 0;
for(i = 2; i < N; i++){
if(p[i] == 0){
for(j = i; j < N; j += i){
p[j] = k;
}
k++;
}
}
while(scanf("%d", &n) != EOF){
printf("%d\n", p[n]);
}
return 0;
}