test/prime_factor.test.cpp

View this file on GitHub
Last update: 2024-04-20 20:43:01+09:00
Problem: https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=NTL_1_A

Depends on

math/prime_factor.hpp

Code

#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=NTL_1_A"
#include <bits/stdc++.h>
using namespace std;
#include "../math/prime_factor.hpp"

int main() {
    long long n;
    cin >> n;
    auto pf = prime_factor(n);
    cout << n << ":";
    for (auto [x, y] : pf) {
        for (int i = 0; i < y; i++) cout << " " << x;
    }
    cout << endl;
}

#line 1 "test/prime_factor.test.cpp"
#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=NTL_1_A"
#include <bits/stdc++.h>
using namespace std;
#line 2 "math/prime_factor.hpp"
using namespace std;

map<long long, int> prime_factor(long long n) {
    map<long long, int> ret;
    for (long long i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            ret[i]++;
            n /= i;
        }
    }
    if (n != 1) ret[n] = 1;
    return ret;
}
#line 5 "test/prime_factor.test.cpp"

int main() {
    long long n;
    cin >> n;
    auto pf = prime_factor(n);
    cout << n << ":";
    for (auto [x, y] : pf) {
        for (int i = 0; i < y; i++) cout << " " << x;
    }
    cout << endl;
}