hdu 1164 Eddy's research I

標籤：

Problem DescriptionEddy‘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 .

 

 

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

 

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

 

Sample Input119412 

 

Sample Output112*2*13*181 

 

Authoreddy 

 

RecommendJGShining   |   We have carefully selected several similar problems for you:  1215 1286 1211 1299 1163   

 1 #include <stdio.h> 2 #include <math.h> 3 #include <queue> 4 #include <vector> 5 #include <stack> 6 #include <map> 7 #include <string> 8 #include <cstring> 9 #include <algorithm>10 #include <iostream>11 using namespace std;12 int main()13 {14     int n,j,i,a[100];15     while(~scanf("%d",&n)){16         i=2;17         j=0;18         while(i<=n){19             if(n%i==0){20                 n/=i;21                 a[j++]=i;22                 i=2;23             }24             else{25                 i++;26             }27         }28         for(int m=0;m<j;m++){29             if(m==j-1){30                 printf("%d\n",a[m]);31             }32             else{33                 printf("%d*", a[m]);34             }35         }36     }37     return 0;38 }

 

hdu 1164 Eddy's research I