Largest prime factor HDU - 2136
Problem
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
ps:巧妙的求素数方法,先打表,后输出
代码如下:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string.h>
#include<math.h>
int a[1000000];
int main()
{
int k = 1;
memset(a, 0, sizeof(a));
for(int i = 2; i < 1000000; i++) {
if(!a[i]) {
a[i] = k;
for(int j = i + i; j < 1000000; j += i)
a[j] = k;
k++;
}
}
int n;
while(~scanf("%d", &n)) printf("%d\n", a[n]);
return 0;
}