HDU 1164 Eddy's research I-CSDN博客

本文链接：https://blog.csdn.net/wlzzhcsdn/article/details/78225593

http://acm.hdu.edu.cn/showproblem.php?pid=1164

Eddy's research I

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3255 Accepted Submission(s): 1994

Problem Description

Eddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divided into the multiply of prime number, but he can't write program, so Eddy has to ask intelligent you to help him, he asks you to write a program which can do the number to divided into the multiply of prime number factor .

Input

The input will contain a number 1 < x<= 65535 per line representing the number of elements of the set.

Output

You have to print a line in the output for each entry with the answer to the previous question.

Sample Input

    11 9412 
  

Sample Output

    11 2*2*13*181 
  

Author

eddy

Recommend

JGShining

分析：素数用哈希打表记录，遍历所有素数判断能否除尽，若能除尽则记录，最后输出。但是要注意，如果能除尽，记录后这个素数还要再次判断。如题目中给出的例子中，9412的因子中有两个2.

代码如下：

#include<stdio.h>
#include<string.h>
int prime[65536];
void fun()
{
int i,j;
memset(prime,1,sizeof(prime));
for(i=2;i<65536;i++)
    for(j=2;i*j<65536;j++)
         if(prime[i])
   prime[i*j]=0;
   prime[0]=prime[1]=0;
}
int main()
{
fun();
int ans[60000];
int i,j;
int w,count;
while(scanf("%d",&w)==1)
{
  count=0;
for(i=65535;i>0;i--)
    {
       if(prime[i])
          if(w%i==0)
             {
       ans[count++]=i;
       w/=i;
       i++;
             }
    }
    printf("%d",ans[count-1]);
    for(i=count-2;i>=0;i--)
       printf("*%d",ans[i]);
     printf("\n");
}
return 0;
}