test/aoj/ntl/prime_factorize.test.cpp

// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/NTL_1_A
#include <iostream>
#include "number_theory/prime_number.hpp"

int main(void) {
    int n;
    std::cin >> n;
    auto v = prime_factorization(n);
    std::cout << n << ':';
    for (auto p : v) {
        for (int i = 0; i < p.second; ++i) std::cout << ' ' << p.first;
    }
    std::cout << '\n';

    return 0;
}