PAT甲级——Prime Factors

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

思路： 首先分析一下给出的数不超过长整型（整型），那么质因数不会超过10^9，所以先求出100010以内的质数表，再用n去除。这里注意，n的质因数最多只有一个大于n的开方，所以除的时候最大除到n的开方就好了。对于同一个因子反复的去除，直到余数不为0，过程中把每个因子和它被除的次数用结构体储存起来，最后统一输出。还有一个要注意的地方就是循环结束后n（此时n变了）不为1，那么这个n就是那个大于初始n值开根号的质因数，把它储存到结构体数组中即可。

代码：

#include <iostream>
#include<cmath>
using namespace std;
const int maxn = 100010;


bool is_prime(int n)
{
	if (n == 1) return false;
	int sqr = (int)sqrt(1.0*n);
	for (int i = 2; i <= sqr; i++)
	{
		if (n%i == 0) return false;
	}
	return true;
}
int prime[maxn],pnum = 0;
void Find_prime()
{
	for (int i = 1; i < maxn; i++)
	{
		if (is_prime(i) == true)
		{
			prime[pnum++] = i;
		}
		
	}
}
struct factor {
	int x, cnt;
}fac[10];

int main()
{
	Find_prime();
	int n, num = 0;
	scanf("%d", &n);
	int sqr = (int)sqrt(1.0*n);
	if (n == 1) printf("1 =1");
	else
	{
		printf("%d=", n);
		for (int i = 0; i < pnum && prime[i] <= sqr; i++)
		{
			if (n%prime[i] == 0)
			{
				fac[num].x = prime[i];
				fac[num].cnt = 0;
				while (n%prime[i] == 0)
				{
					fac[num].cnt++;
					n /= prime[i];
				}
				num++;
			}
			if (n == 1) break;
		}
		if (n != 1)
		{
			fac[num++].x = n;
			fac[num++].cnt = 1;
		}
		for (int i = 0; i < num; i++)
		{
			if (i > 0) printf("*");
			printf("%d", fac[i].x);
			if (fac[i].cnt > 1) printf("^%d", fac[i].cnt);
		}
	}
	return 0;
}