1059 Prime Factors (25)（25 point(s)）

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<cmath>
using namespace std;
int n;
struct factor{
	int x, cnt;
}p[110];
bool isPrime(int n){
	if(n<=1)return false;
	int k=sqrt(1.0*n);
	for(int i=2; i<=k; i++){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
int num=0;
void find_Prime(){
	int k=sqrt(1.0*n);
	for(int i=2; i<=k; i++){
		if(isPrime(i)==true&&n%i==0){
			p[num].x=i;
			p[num].cnt=0;
			num++;
		}
	}
}
int main() {
    scanf("%d", &n);
    printf("%d=", n);
    if(n==1)printf("1");
    else{
    	find_Prime();
    for(int i=0; i<num; i++){
    	int j=p[i].x;
    	while(1){
    		if(n%j!=0)break;
    		n/=j;
    		p[i].cnt++;
		}
		if(n==1)break;
	}
	if(n!=1){
		p[num].x=n;
		p[num].cnt++;
	}
	for(int i=0; i<=num; i++){
		if(p[i].cnt!=0){
			if(i==0)printf("%d", p[i].x);
			else printf("*%d", p[i].x);
			if(p[i].cnt>1)printf("^%d",p[i].cnt);
		}
	}
	}
    return 0;
}