【C++ 程序】质因数分解

最新推荐文章于 2024-09-07 11:15:13 发布

Teddy van Jerry

最新推荐文章于 2024-09-07 11:15:13 发布

阅读量3k

点赞数 1

分类专栏：【C++】自编程序文章标签： c++ 小程序

本文链接：https://blog.csdn.net/weixin_50012998/article/details/109219940

版权

【C++】自编程序专栏收录该内容

52 篇文章 15 订阅

订阅专栏

程序

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

vector<unsigned> prime; // a vector that contains prime numbers

void prime_def(int n) // define the vector
{
	for (int ii = 2; ii <= n; ii++)
	{
		int index = 1;
		for (int j = 2; j <= sqrt(ii); j++)
			if (ii % j == 0)
				index = 0;
		if (index == 1) prime.push_back(ii);
	}
}

void fact(int n)
{
	if (n == 1) cout << 1 << endl;
	else
	{
		int alr = 1;
		if (n == *(--prime.cend()))
			// If n is a prime number, just print itself.
			// Otherwise in the for loop,
			// subscript will be out of range
			// because when doing i++,
			// it will go to one beyond the end.
			cout << n;
		else
		{
			for (size_t i = 0; prime[i] <= n / alr; i++)
			{
				int state = 0;
				while (state == 0)
				{
					if (n / alr % prime[i] == 0)
					{
						cout << ((alr == 1) ? "" : " * ") << prime[i];
						alr *= prime[i];
					}
					else state = 1;
				}
			}
		}
		cout << endl;
	}
}

int main()
{
	int n;
	cin >> n;
	cout << n << " = ";
	prime_def(abs(n));
	if (n < 0)
	{
		cout << "- ";
		n = -n; // change into the positive
	}
	fact(n);
	return 0;
}