PAT A1059. Prime Factors (25)

最新推荐文章于 2024-07-15 22:53:16 发布

阿豪boy

最新推荐文章于 2024-07-15 22:53:16 发布

阅读量64

点赞数

文章标签：算法 java 数据结构 c语言 python

本文链接：https://blog.csdn.net/qq_35516360/article/details/122067460

版权

原文链接: PAT A1059. Prime Factors (25)

上一篇: PAT A1096. Consecutive Factors (20)

下一篇: PAT B1017. A除以B (20)

1059. Prime Factors (25)

https://www.patest.cn/contests/pat-a-practise/1059

时间限制

100 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

HE, Qinming

Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N = p1^k1 * p2^k2 *…*pm^km.

Input Specification:

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

Output Specification:

Factor N in the format N = p1^k1 * p2^k2 *…*pm^km, where pi's are prime factors of N in increasing order, and the exponent ki is the number of pi -- hence when there is only one pi, ki is 1 and must NOT be printed out.

Sample Input:

97532468

Sample Output:

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

题目大意：给出一个整数，按照从小到大的顺序输出其分解为质因数的乘法算式
分析：先建立个500000以内的素数表，然后从2开始一直判断是否为它的素数，如果是就将a=a/i继续判断i是否为a的素数，判断完成后输出这个素数因子和个数，用state判断是否输入过因子，输入过就要再前面输出“*”

#include <cstdio>
#include <vector>
using namespace std;
int main() {
	long int a;
	scanf("%ld", &a);
	printf("%ld=", a);
	if (a == 1) printf("1");
	bool state = false;
	for (int i = 2; a >= 2; i++) {
		int cnt = 0, flag = 0;
		while (a % i == 0) {
			cnt++;
			a = a / i;
			flag = 1;
		}
		if (flag) {
			if (state) printf("*");
			printf("%d", i);
			state = true;
		}
		if (cnt >= 2)
			printf("^%d", cnt);
	}
	return 0;
}