verify/aizu_online_judge/ntl/prime_factorize.test.cpp

View this file on GitHub
Last update: 2024-11-09 01:34:39+09:00
Problem: https://onlinejudge.u-aizu.ac.jp/courses/library/6/NTL/1/NTL_1_A

Depends on

Code

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/6/NTL/1/NTL_1_A"
#include "../../../src/template/template.hpp"
#include "../../../src/math/prime_factors.hpp"
int main(void) {
    ll n;
    cin >> n;
    vector<pair<ll, int>> p = prime_factors(n);
    cout << n << ':';
    for(const auto& it : p) {
        for(int i = 0; i < it.second; ++i) {
            cout << ' ' << it.first;
        }
    }
    cout << '\n';
}

#line 1 "verify/aizu_online_judge/ntl/prime_factorize.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/6/NTL/1/NTL_1_A"
#line 2 "src/template/template.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<long long, long long>;
#define rep(i, a, b) for(long long i = (a); i < (b); ++i)
#define rrep(i, a, b) for(long long i = (a); i >= (b); --i)
constexpr long long inf = 4e18;
struct SetupIO {
    SetupIO() {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout << fixed << setprecision(30);
    }
} setup_io;
#line 3 "src/math/prime_factors.hpp"
vector<pair<long long, int>> prime_factors(long long n) {
    assert(n >= 1);
    vector<pair<long long, int>> res;
    for(long long i = 2; i * i <= n; ++i) {
        if(n % i == 0) {
            res.emplace_back(i, 0);
            while(n % i == 0) {
                n /= i;
                ++res.back().second;
            }
        }
    }
    if(n >= 2) res.emplace_back(n, 1);
    return res;
}
#line 4 "verify/aizu_online_judge/ntl/prime_factorize.test.cpp"
int main(void) {
    ll n;
    cin >> n;
    vector<pair<ll, int>> p = prime_factors(n);
    cout << n << ':';
    for(const auto& it : p) {
        for(int i = 0; i < it.second; ++i) {
            cout << ' ' << it.first;
        }
    }
    cout << '\n';
}