在C++中以指数形式打印素数分解

#include <iostream>
#include <vector>

// 判断一个数是否为素数
bool isPrime(int num) {
    if (num < 2) {
        return false;
    }
    for (int i = 2; i * i <= num; i++) {
        if (num % i == 0) {
            return false;
        }
    }
    return true;
}

// 打印素数分解结果
void printPrimeFactorization(int num) {
    std::vector<int> factors;
    for (int i = 2; i <= num; i++) {
        if (isPrime(i)) {
            while (num % i == 0) {
                factors.push_back(i);
                num /= i;
            }
        }
    }
    std::cout << "素数分解结果：" << std::endl;
    for (int i = 0; i < factors.size(); i++) {
        int count = 1;
        while (i + 1 < factors.size() && factors[i] == factors[i + 1]) {
            count++;
            i++;
        }
        std::cout << factors[i];
        if (count > 1) {
            std::cout << "^" << count;
        }
        if (i + 1 < factors.size()) {
            std::cout << " * ";
        }
    }
    std::cout << std::endl;
}

int main() {
    int num;
    std::cout << "请输入一个正整数：";
    std::cin >> num;
    printPrimeFactorization(num);
    return 0;
}