hdu 1164 Eddy‘s research I

最新推荐文章于 2019-08-02 18:01:31 发布

chentian114

最新推荐文章于 2019-08-02 18:01:31 发布

阅读量362

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM 文章标签： hdu 1164 算法 c acm 筛选法

本文链接：https://blog.youkuaiyun.com/chentian114/article/details/6801759

ACM 专栏收录该内容

25 篇文章

订阅专栏

本文介绍了一种质因数分解算法的实现方法，并通过C语言编程实现了将任意整数分解为其质因数乘积的功能。该算法首先生成一定范围内的质数表，然后利用这些质数对输入的整数进行分解。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

9412

Sample Output

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;
}