PAT 甲级 1059. Prime Factors (25)

Given any positive integer N, you are supposed to find all of its prime factors, and write them in the format N = p₁^k₁ * p₂^k₂ *…*p_m^k_m.

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 = p₁^k₁ * p₂^k₂ *…*p_m^k_m, where p_i's are prime factors of N in increasing order, and the exponent k_i is the number of p_i -- hence when there is only one p_i, k_i is 1 and must NOT be printed out.

Sample Input:

97532468

Sample Output:

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

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <stack>
#include <queue>
using namespace std;
vector<int> prime(500000, 1);
int main() {
	for (int i = 2; i*i < 500000; i++)
		for (int j = 2; j*i < 500000; j++)
			prime[j*i] = 0; //建立素数表
	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 (prime[i] == 1 && 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;
}