1059 Prime Factors (25point(s))质因子分解

最新推荐文章于 2020-08-18 01:08:24 发布

rockkyy

最新推荐文章于 2020-08-18 01:08:24 发布

阅读量167

点赞数

分类专栏： pta

本文链接：https://blog.csdn.net/lx18303916/article/details/104456919

版权

pta 专栏收录该内容

49 篇文章 0 订阅

订阅专栏

Given any positive integer NNN, you are supposed to find all of its prime factors, and write them in the format NNN = p1k1×p2k2×⋯×pmkm{p_1}^{k_1}\times {p_2}^{k_2} \times \cdots \times {p_m}^{k_m}p1k1×p2k2×⋯×pmkm.

Input Specification:

Each input file contains one test case which gives a positive integer NNN in the range of long int.

Output Specification:

Factor NNN in the format NNN = p1p_1p1^k1k_1k1*p2p_2p2^k2k_2k2*…*pmp_mpm^kmk_mkm, where pip_ipi's are prime factors of NNN in increasing order, and the exponent kik_iki is the number of pip_ipi -- hence when there is only one pip_ipi, kik_iki is 1 and must NOT be printed out.

Sample Input:

97532468

Sample Output:

97532468=2^2*11*17*101*1291

思路：把素数表先存起来，因为是是int以内， sqrt(max int) 在比10的五次方小，素数表开到10五次方就行了，再用n值和素数表的数逐个比对。

#include <iostream>
#include <math.h>
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
using namespace std;
int isPrime(int x){
	if(x == 1) return 0;
	int sqr = (int)sqrt(1.0 * x);
	for(int i = 2; i <= sqr; i++){
		if(x % i == 0) return 0;
	}
	return 1;
}
const int maxn = 100010;
int prime[maxn], pnum = 0;
void Find_Prime(){
	for(int i = 2; i < maxn; i++){
		if(isPrime(i)){
			prime[pnum++] = i;
		}
	}
}
struct factor{
	int x, cnt;
};
int main(int argc, char** argv) {
	factor fac[10];
	Find_Prime();
	int n, num = 0;
	cin >> n;
	if(n == 1) cout << "1=1";
	else{
		cout << n << "=";
		int sqr = (int)sqrt(1.0 * n);
		for(int i = 0; i < pnum && prime[i] <= sqr; i++){
			if(n % prime[i] == 0){
				fac[num].x = prime[i];
				fac[num].cnt = 0;
				while(n % prime[i] == 0){
					fac[num].cnt++;
					n /= prime[i];
				}
				num++;
			}
			if(n == 1) break;
		}
		if(n != 1){
			fac[num].x = n;
			fac[num++].cnt = 1;
		}
		cout << fac[0].x;
		if(fac[0].cnt > 1) cout << "^" << fac[0].cnt;
		for(int i = 1; i < num; i++){
			cout << "*" << fac[i].x;
			if(fac[i].cnt > 1) cout << "^" << fac[i].cnt;
		}
	}
	return 0;
}