【PAT】1059. Prime Factors (25)

题目链接：http://pat.zju.edu.cn/contests/pat-a-practise/1059

题目描述：

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

分析：（1）先建立素数组（2）要考虑输入为 1 的特例。

参考代码：

#include<iostream>
#include<cmath>
using namespace std;

#define max 1000
int prime[max];
int i;
int j;

bool isPrime(int temp)
{
	int t;
	bool flag = true;
	for(t = 2; t <= sqrt(temp); t++)
		if( temp%t == 0) {flag = false; break;}
	return flag;
}

int main()
{
	prime[0] = 2;
	j = 3;
	for(i=1; i<max; i++)
	{
		for(; j<100000; j++ )
		{
			if( isPrime(j) )
			{
				prime[i] = j++;
				break;
			}
		}
	}

	long input;
	int temp;
	int num;
	cin>>input;
	cout<<input<<"=";
	if(input == 1) //特例
		cout<<input;
	else
	{
		for(i=0; input != 1; i++)
		{
			num = 0;
			while( (input%prime[i]) == 0)
			{
				num++;
				input = input/prime[i];
			}
			if(num >= 1)
			{
				cout<<prime[i];
				if(num > 1)
					cout<<"^"<<num;
				if(input != 1)
					cout<<"*";
			}
		}
	}	
	cout<<endl;
	return 0;
}