hdu1164 Eddy's research I

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

C语言AC代码

#include<stdio.h>
#include<string.h>
int num[70000],prime[50000];
#define N 70000
void primes()
{
    int i,j,k;
    k=0;
    memset(num,0,sizeof(num));
    for(i=2; i<N; i++)
    {
        if(num[i]==0)
            prime[k++]=i;
        for(j=0; (j<k)&&(i*prime[j])<N; j++)
        {
            num[i*prime[j]]=1;
            if(i%prime[j]==0)
                break;
        }
    }
}
int main()
{
    int x;
    int ans[100];
    primes();
    while(scanf("%d",&x)!=EOF)
    {
        int i,j=0;
        for(i=0; prime[i]<=x; i++)
        {
            if(x==0||x==1)
                break;
            if(x%prime[i]==0)
            {
                ans[j++]=prime[i];
                x=x/prime[i];
                i=-1;
            }
        }
        for(i=0; i<j; i++)
        {
            if(i<j-1)
                printf("%d*",ans[i]);
            else
                printf("%d\n",ans[i]);
        }
    }
    return 0;
}

思路：输入x后，每次要记得从第一个素数开始，找到x可以除尽的素数记录下来。

筛素数法：1一个素数的倍数不是素数；2一个数与素数的乘积必然不是素数；3一个数是素数的倍数，它就不用与之后的素数相乘

可以参见我以前写的一道题目：http://blog.csdn.net/sinat_39591298/article/details/76695928