英文题：Eddy's research I

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

让你一生残梦

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

阅读量386

点赞数

CC 4.0 BY-SA版权

分类专栏：数论之素数问题模板文章标签：一切尽在暴力中

本文链接：https://blog.youkuaiyun.com/ZJWSA/article/details/81174157

数论之素数问题模板专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一种质因数分解算法的实现方法，并通过C++代码详细展示了如何将一个整数分解为其质因数的乘积形式。该算法利用了预处理质数和质数筛减法来提高分解效率。

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

Title 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 <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <map>
using namespace std;
#define Max 65535
int data[Max + 100],jj;
bool vis[Max + 100];


void yuchuli()
{
    jj=0;
    memset(vis,true,sizeof(vis));
    vis[1] = false;
    for(int i = 2; i<= Max ;i++)
    {
        if(vis[i] == true){
            data[jj++] = i;
            for(int j=i+i;j<=Max;j=j+i)
                vis[j] = false;
        }
    }
}

int main()
{
    yuchuli();
    int t;
    while(scanf("%d",&t)!=EOF)
    {
        int ff =0;
        for(int i = 0; i<=jj && data[i]<=t ;i++){
            while(t%data[i]==0 && data[i]<=t) {
                t = t/data[i];
                if(ff++!=0) printf("*");
                printf("%d",data[i]);
            }
        }
        printf("\n");
    }
    return 0;
}