PAT 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 = 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>
using namespace std;

typedef long long LL;

bool isPrime(LL n) {

    for(LL i = 2; i * i <= n; i ++) {
        if(n % i == 0)
            return false;
    }
    return true;
}

int main()
{
    LL n;
    cin >> n;
    LL t = n, k;
    int flag = 1;
    if(isPrime(n)) {
        cout << n << "=" << n << endl;
    }
    else {
        cout << n << "=";
        for(int i = 2; i * i <= n; i ++) {
            if(isPrime(i)) {
                k = 0;
                while(t % i == 0) {
                    k ++;
                    t /= i;
                }
                if(k == 1) {
                    if(flag) {
                        cout << i;
                        flag = 0;
                    }
                    else {
                        cout << "*" << i;
                    }
                } else if(k >= 2) {
                    if(flag) {
                        cout << i << "^" << k;
                        flag = 0;
                    } else {
                        cout << "*" << i << "^" << k;
                    }
                }
            }
        }
        cout << endl;
    }
    return 0;
}