HDU 1164 Eddy's research I

最新推荐文章于 2022-10-27 22:16:34 发布

原创最新推荐文章于 2022-10-27 22:16:34 发布 · 494 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

HDU 专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一个用于将整数分解为其质因数的程序。该程序接收一个输入数字，并输出其所有质因数的乘积形式。算法首先使用2到根号n之间的所有数字尝试去除输入数字n，直至无法再被整除，最后检查剩余数字是否为质数。

Eddy's research I

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

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

题意：分解质因数。

CODE：

#include <iostream>
#include <cmath>
using namespace std;

int main()
{
    int a[105];
    int n;
    while(cin>>n){
        int cnt=0;
        for(int i=2;i<=sqrt(n);i++){
            while(n%i==0){
                a[cnt++]=i;
                n/=i;
            }
        }
        if(n!=1)
            a[cnt++]=n;
        for(int i=0;i<cnt-1;i++)
            cout<<a[i]<<'*';
        cout<<a[cnt-1]<<endl;
    }
}