test/prime_factorization.test.cpp

View this file on GitHub
Last update: 2020-11-27 17:14:27+09:00
Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=NTL_1_A

Depends on

Code

#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=NTL_1_A"

#include "src/template.hpp"
#include "src/prime_factorization.hpp"

int main() {
  ll n;
  cin >> n;

  auto m = prime_factorization(n);

  cout << n << ": ";
  vl ans;
  for (auto&& i : m) {
    rep(j, i.second) {
      ans.push_back(i.first);
    }
  }
  cout << ans << el;
}

#line 1 "test/prime_factorization.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=NTL_1_A"

#line 2 "src/template.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pl = pair<ll, ll>;
using vl = vector<ll>;
#define rep(i, n) for(ll i = 0; i < (ll)n; i++)
#define rep3(i, l, r) for(ll i = l; i < (ll)r; i++)
#define per(i, n) for(ll i = (ll)n-1; i >= 0; i--)
#define per3(i, l, r) for(ll i = (ll)r-1; i >= (ll)l; i--)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
template<class T, class U> inline void cmax(T &a, U b) { if (a < b) a = b; }
template<class T, class U> inline void cmin(T &a, U b) { if (a > b) a = b; }
constexpr char el = '\n';
template<class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<class T, class U> istream &operator>>(istream &is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<class T> ostream &operator<<(ostream &os, const vector<T> &v) { rep(i, v.size()) os << v[i] << (i+1 != (ll)v.size() ? " " : ""); return os; }
template<class T> istream &operator>>(istream &is, vector<T> &v) { for(T &i : v) is >> i; return is; }
struct IoSetup {
  IoSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(15); }
} io_setup;
#line 3 "src/prime_factorization.hpp"

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

int main() {
  ll n;
  cin >> n;

  auto m = prime_factorization(n);

  cout << n << ": ";
  vl ans;
  for (auto&& i : m) {
    rep(j, i.second) {
      ans.push_back(i.first);
    }
  }
  cout << ans << el;
}