Submission

Status:

PPPT-PPP--

Score: 60

User: 17458

Problemset: แยกตัวประกอบ

Language: cpp

Time: 1.074 second

Submitted On: 2024-11-20 19:15:01

#include <bits/stdc++.h>
using namespace std;

map<int,int> factor;
bool is_prime(int n) {
    for (int i = 2;i < sqrt(n);i++) if (n % i == 0) return false;
    return true;
}

int main() {
    float n; cin >> n;
    //prime

    int i = 2;
    while (n > 1) {
        if (is_prime(i)) {
            while (trunc(n / i) == (n/i)) {
                factor[i]++;
                n /= i;
            }
        }
        i++;
    }

    for (auto p : factor) cout << p.first << '^' << p.second << ' ';
}