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​1​​​k​1​​​​×p​2​​​k​2​​​​×⋯×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​1​​^k​1​​*p​2​​^k​2​​*…*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 <stdio.h>
#include <vector>
#include <iostream>
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[i*j] = 0;//i*j的那个数肯定不是素数  因为i*j能等于它 所以赋值为0表示不是素数
		}
	}
	long int a;
	scanf("%d", &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 /= i;
			flag = 1;
		}
		if (flag) //有质因子要进行输出
		{
			if (state) //判断之前是否有质因子输出过  输出过的话得输出个乘号
			{
				cout << "*";
			}
			cout << i;
			state = true;
			
		}
		if (cnt>=2) //质因子数量非1  以平方形式输出
		{
			cout << "^"<<cnt;
		}
	}
	return 0;
}