Eddy's research I

Eddy's research I

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 14   Accepted Submission(s) : 12

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

输入一个数，输出相乘能够等于该数的素数；

 1 #include <stdio.h>
 2 #define Max(a,b) a>b? a:b
 3 #define Min(a,b) a>b? b:a
 4 #include <string.h>
 5 int main()
 6 {
 7     int i,j,a[66535]={0},NUM,b[10000],k;
 8     for(i=2;i<=65535;i++)
 9         a[i]=1;
10     for(i=2;i<=65535;i++)   /*素数筛选出该范围内所以素数*/
11         if(a[i])
12             for(j=i+i;j<=65535;j+=i)
13                 a[j]=0;
14     while(scanf("%d",&NUM)!=EOF)
15     {
16         if(a[NUM])          /*如果该数字就是素数，那么只需要输出该数字就是答案*/
17         {
18             printf("%d\n",NUM);
19             continue;
20         }
21         k=0;                    
22         for(i=NUM-1;i>=2;i--)    /*从该数组的前一位，一直向前查找*/
23             while(a[i]&&NUM%i==0)  /*如果查找到能够被该数整除的数组，存取，并且更新该数*/
24             {
25                 NUM/=i;
26                 b[k++]=i;
27             }
28         for(j=k-1;j>=0;j--)
29         {
30             printf("%d",b[j]);      /*反序输出即为所求答案*/
31             if(j!=0)putchar('*');
32         }
33         putchar(10);
34     }
35     return 0;
36 }

View Code

 修改：2015.6.2

根据所求的，只需要知道能够被该数整除的素数，依次取出那些数以及个数即可、

 1 #include <iostream>
 2 #include <stdio.h>
 3 #include <string.h>
 4 using namespace std;
 5 int Pr[65540]={0};
 6 void Cread()
 7 {
 8     int i,j;
 9     for(i=1;i<=65535;i++)Pr[i]=1;
10     for(i=2;i<=65535;i++)
11         if(Pr[i])
12             for(j=2;i*j<=65535;j++)
13                 Pr[i*j]=0;
14     return ;
15 }
16 int main()
17 {
18     int N,i,j,k,sign=0;
19     Cread();
20     while(scanf("%d",&N)!=EOF)
21     {
22         sign=0;
23         for(i=2;i<=N;i++)
24         {
25             if(N==1)break;
26             if(Pr[i])
27             {
28                 j=N;
29                 while(N%i==0)
30                 {
31                     if(sign)putchar('*');
32                     printf("%d",i);
33                     sign=1;
34                     N/=i;
35                 }
36             }
37         }putchar(10);
38     }
39     return 0;
40 }

View Code

 

转载于:https://www.cnblogs.com/Wurq/articles/3929177.html