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 = p₁k₁×p₂k₂×⋯×p_mk_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>

using namespace std;

void print(bool isprint) {
    if (isprint)
        cout << "*";
}

void divide(long long x) {
    bool isPrint = false;
    cout << x << "=";
    if (x == 1) {
        cout << 1;
        return;
    }
    for (long long i = 2; i <= x / i; ++i) {
        if (x % i == 0) {
            int s = 0;
            while (x % i == 0) x /= i, s++;
            print(isPrint);
            if (s == 1) {
                cout << i;
                isPrint = true;
            } else if (s > 1) {
                cout << i << '^' << s;
                isPrint = true;
            }
        }
    }
    if (x > 1) {
        print(isPrint);
        cout << x;
    }
}


int main() {
    long long N;
    cin >> N;
    divide(N);
    return 0;
}