HDU 1164 Eddy's research I [prime Limit Method]

Idea: divide the input number into the result of multiplying n prime numbers and store them in an array. And then output it.

Eddy's research itime limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others) Total submission (s): 6633 accepted submission (s): 3971

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 Input

119412

 
Sample output

112*2*13*181

 
Authoreddy

#include<stdio.h>#include<string.h>int a[55];int getprime(int x){    memset(a,0,sizeof(a));    int i,cnt=0;    for(i=2; i<=x; i++)    {        while(x%i==0)        {            a[cnt++]=i;            x=x/i;        }    }    return cnt;}int main(){    int n;    while(~scanf("%d",&n))    {        int k,i;        k=getprime(n);        for(i=0; i<k-1; i++)            printf("%d*",a[i]);        printf("%d\n",a[k-1]);            }    return 0;} 

HDU 1164 Eddy's research I [prime Limit Method]