Eddy's research I
Eddy's research I
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7389 Accepted Submission(s):
4472
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
1 #include <stdio.h> 2 int main() 3 { 4 int s[10000],n,i; 5 while(scanf("%d",&n)) 6 { 7 int k=0; 8 for(i=2;i<=n;i++) 9 { 10 while(n%i==0) 11 { 12 s[k++]=i; 13 n=n/i; 14 } 15 } 16 for(i=0;i<k;i++) 17 { 18 if(i==k-1) 19 printf("%d",s[i]); 20 else 21 printf("%d*",s[i]); 22 } 23 printf("\n"); 24 } 25 }