杭电1164

最新推荐文章于 2020-02-26 21:00:00 发布

盘古工作室

最新推荐文章于 2020-02-26 21:00:00 发布

阅读量370

点赞数

CC 4.0 BY-SA版权

分类专栏：数学

本文链接：https://blog.youkuaiyun.com/qq_22441525/article/details/47076323

数学专栏收录该内容

25 篇文章

订阅专栏

本文详细介绍了质因分解的概念及其在数论中的应用，通过实例演示如何使用质因分解算法将任意整数分解为质数的乘积，并提供了一个简洁高效的C++代码实现，适合初学者和专业程序员学习和参考。

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

杭电1164

Eddy's research I

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7549 Accepted Submission(s): 4585

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

119412

Sample Output

112*2*13*181

分析：

简单的质因分解，从2开始依次分解。注意格式一次AC

代码：

#include<iostream>
using namespace std;
int main()
{
	int n;
	while (cin >> n)
	{
		int i;
		for (i = 2; i <= n; i++)
		{
			while (n%i == 0)
			{
				n = n / i;
				if (n == 1)
					cout << i;
				else
					cout << i << '*';
			}
		}
		cout << endl;
	}
return 0;
}