Largest prime factor
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 16392 Accepted Submission(s): 5701
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.
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
Largest prime factor
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 16392 Accepted Submission(s): 5701
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.
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
题目大意:找出n的最大素因子在素数表中的位置
代码:
#include <cstdio>
#include <cstring>
const int MAX=1e6;
using namespace std;
long long prime[MAX];
int main()
{
long long num,i,j,n;
memset(prime,0,sizeof(prime));
prime[1]=0;
num=0;
for(i=2;i<MAX;i++)
{
if(prime[i]==0)
{
num++;
for(j=i;j<MAX;j+=i)
prime[j]=num;
}
}
while(scanf("%lld",&n)!=-1)
printf("%lld\n",prime[n]);
return 0;
}