Eddy's research I

最新推荐文章于 2018-09-24 22:13:00 发布

祖国的小果abc

最新推荐文章于 2018-09-24 22:13:00 发布

阅读量415

点赞数

CC 4.0 BY-SA版权

分类专栏：图论、数学几何、hash其他

本文链接：https://blog.csdn.net/zuguodexiaoguoabc/article/details/47275939

图论、数学几何、hash其他专栏收录该内容

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): 7601 Accepted Submission(s): 4618

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

Author

eddy

这个方法不错。由小到大~参考博客：http://blog.csdn.net/lishuhuakai/article/details/8184207

#include<iostream>
#include<stdio.h>
#include<math.h>
#include<string.h>
using namespace std;
bool a[65535];
void isprime()
{
    memset(a,true,sizeof(a));
    int i,j;
    a[0]=a[1]=false;
    for(i=2;i<sqrt(65535);i++)
    {
        if(a[i])
        {
            for(j=i*i;j<65535;j+=i)
            {
                a[j]=false;
            }
        }
    }
}
int main()
{
    int x,flag,i,max;
    isprime();
    while(scanf("%d",&x)!=EOF)
    {
        max=x;
        flag=1;
        for(i=2;i<=max;i++)
        {
            while(a[i] && x%i==0)
            {
                   if(flag)
                    {
                     cout<<i;
                       flag=0;
                    } 
                    else
                    {
                        cout<<"*"<<i;
                    }
                x=x/i;
                if(x==1) 
                {cout<<endl;break;
                 }
            }
            
        }
    }
    return 0;
}