因子分解题解

#include <bits/stdc++.h>
using namespace std;
bool prime(int n){
    if(n == 1) return false;
    for(int i = 2;i * i <= n;i ++){
        if(n % i == 0) return false;
    }
    return true;
}
void solve(int x){
    if(x == 1) return ;
    for(int i = 2;i <= x;i ++){
        if(x % i == 0){
            int temp = 0;
            while(x % i == 0){
                temp ++;
                x /= i;
            }
            cout << i;
            if(temp != 1) cout << "^" << temp;
            if(x != 1) cout << "*";
            break;
        }
    }
    solve(x);
}
int main(){
    int n;
    cin >> n;
    solve(n);
    return 0;
}