HDU 2136 Largest prime factor

Largest prime factor

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 11058    Accepted Submission(s): 3902

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
  
  

 

Author

Wiskey

 

Source

HDU 2007-11 Programming Contest_WarmUp

 

Recommend

威士忌   |   We have carefully selected several similar problems for you:   2138  2133  2135  1215  2137 

 

求N的最大素因子的位置

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int a[1000000];
void getprim()
{
	int i,j,k;
	memset(a,0,sizeof(a));
	k=1;
	a[0]=1;
	for(i=2;i<=1000000;i++)
	{
		if(!a[i])
		{
			a[i]=k;
			for(j=i+i;j<=1000000;j+=i)
			   a[j]=k;
			k++;
		}
	}
}
int main()
{
	int n;
	getprim();
	while(scanf("%d",&n)!=EOF)
	{
		
		printf("%d\n",a[n]);
	}
	return 0;
}