1059 Prime Factors

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

线性筛素数建立素数表： 

#include <iostream>
#include <bitset>
using namespace std;
long long int prime[10000010];

bitset<100000010>b;//不是素数为1 是素数为0
int main() {
	long long int n, cnt = 0, k;
	b[1] = 1;
	for (int i = 2; i <= 100009; i++) {
		if (!b[i]) {
			prime[++cnt] = i;
		}
		for (int j = 1; j <= cnt && i * prime[j] <= 100009; j++) {
			b[i * prime[j]] = 1;
			if (i % prime[j] == 0) {
				break;
			}
		}
	}
	cin >> n;
	cout << n << '=';
	if (n == 1) {
		cout << 1;
		return 0;
	}
	while (n != 1) {
		bool flag = 0;
		for (int i = 1; i <= cnt; i++) {
			flag = 0;
			k = 0;
			while (n % prime[i] == 0) {
				k++;
				n /= prime[i];
				flag = 1;
			}
			if (flag) {
				cout << prime[i];
				if (k > 1) {
					cout << '^' << k;
				}
				if (n > 1) {
					cout << '*';
				}
			}
		}
	}
	return 0;
}