HDU_1164 Eddy's research I

Eddy's research I

2014-7-29 11:45

 

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

119412

 

 

Sample Output

112*2*13*181

 

 

#include<stdio.h>#include<stdlib.h>#define MAX 65550int a[MAX]={1,1};int b[MAX];void count()               //打第一个表，判断题目范围内的素数和合数 {     for(int i=2;i*i<=MAX;i++)     {        if(!a[i])        {           for(int j=i*i;j<=MAX;j+=i)             a[j]=1;        }     }}void primelist()            //打第二个表，把素数存入b数组 {      int l=1;    for(int k=2;k<=65535;k++)    {         if(!a[k])   b[l++]=k;   //写的时候这个地方错了，一直没调试出来     }}int main(){    count();    primelist();    int n,p;    while(~scanf("%d",&n))    {         int first=1;         while(n!=1)                {               for(p=1;;p++)               {                   if(n%b[p]==0)                    {                        if(first)  {printf("%d",b[p]);  first=0;}   //输出格式                         else  printf("*%d",b[p]);                        break;                   }               }               n=n/b[p];         }         printf("\n");    }    return 0;}