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 <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <vector>
using namespace std;

bool isprime(long long n,long long &factor)
{
	for(long i=factor;i<=sqrt(n);i++)
	{
		if(n%i==0)
		{
			factor=i;
			return false;
		}
	}
	return true;
}

int main()
{
	long long n;
	scanf("%lld",&n);
	long long save=n;
	if(n<=3) 
	{
		printf("%lld=%lld",n,n);
		return 0;
	}
	vector<long long>fac;
	vector<long long>exp;
	long long factor=2;
	while(true)
	{
		bool flg=isprime(n,factor);
		if(flg) break;
		else
		{
			fac.push_back(factor);
			n=n/factor;
			long long count=1;
			while(n%factor==0)
			{
				count++;
				n=n/factor;
			}
			exp.push_back(count);
		}
		if(n==1) break;
	}
	printf("%lld=",save);
	for(int i=0;i<fac.size();i++)
	{
		printf("%lld",fac[i]);
		if(exp[i]>=2) printf("^%lld",exp[i]);
		if(i<fac.size()-1) printf("*");
	}
	if(n!=1) printf("*%lld",n);
}