Largest prime factorCrawling in process...
Crawling failed Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Description
Input
Output
Sample Input
Sample Output
Hint
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<cstdio> #include<algorithm> #include<cstring> using namespace std; int a[1000000+11]; int main() { int k=1; memset(a,0,sizeof(a)); for(int i=2;i<=1000011;i++) { if(a[i]==0)//是素数 { a[i]=k;//素数i的位置 for(int j=2*i;j<=1000011;j+=i) a[j]=k;//j的最大素数因子所在位置 k++; } } int n; while(~scanf("%d",&n)) { printf("%d\n",a[n]); } return 0; }