hdu 1164 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): 2670    Accepted Submission(s): 1651

 

 

 

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

 

 

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define N 70000
int num[N] ;
void prime ( )
{
     for( int i = 2 ; i < N/2 ; i++ ) 
     if( !num[i] ) 
       for( int j = i*i ; j < N ; j+=i )        
             num[j] = 1 ; 
 }
int main(  )
{
    memset( num , 0 , sizeof( num ) ) ;
    prime( ) ;
    int n , i;
    while ( scanf("%d" , &n ) != EOF )
    {
      int f = 1 ;
       while( n != 1 )
       {
          for(  i = 2 ; i < N ; i++ )
           {
               if( !num[i] && n%i == 0 )
                  {
                     if( f )
                     { printf("%d" , i ) ;
                      f = 0 ;}
                  
               else { printf("*%d" , i ) ; }
               break;
               }
           }
           n /= i ;
       }
       puts("");
    }
  //  system( "pause" );
    return 0;
}