test/verify/aoj-ntl-1-a.test.cpp

• View this file on GitHub
• Last update: 2024-07-28 19:56:12+09:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=NTL_1_A

Depends on

• Prime Factor(素因数分解) (math/number-theory/prime-factor.hpp)
• template/template.hpp

Code

// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=NTL_1_A

#include "../../template/template.hpp"

#include "../../math/number-theory/prime-factor.hpp"

int main() {
  int N;
  cin >> N;
  cout << N << ":";
  for(auto p : prime_factor(N)) {
    while(p.second--) cout << " " << p.first;
  }
  cout << endl;
}

#line 1 "test/verify/aoj-ntl-1-a.test.cpp"
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=NTL_1_A

#line 1 "template/template.hpp"
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}

template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename T = int64>
vector<T> make_v(size_t a) {
  return vector<T>(a);
}

template <typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t) fill_v(e, v);
}

template <typename F>
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(std::forward<F>(f)) {}

  template <typename... Args>
  decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};

template <typename F>
inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{std::forward<F>(f)};
}
#line 4 "test/verify/aoj-ntl-1-a.test.cpp"

#line 1 "math/number-theory/prime-factor.hpp"
map<int64_t, int> prime_factor(int64_t n) {
  map<int64_t, int> ret;
  for (int64_t i = 2; i * i <= n; i++) {
    while (n % i == 0) {
      ret[i]++;
      n /= i;
    }
  }
  if (n != 1) ret[n] = 1;
  return ret;
}
#line 6 "test/verify/aoj-ntl-1-a.test.cpp"

int main() {
  int N;
  cin >> N;
  cout << N << ":";
  for(auto p : prime_factor(N)) {
    while(p.second--) cout << " " << p.first;
  }
  cout << endl;
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_small_00.in	AC	5 ms	3 MB
g++	00_small_01.in	AC	5 ms	3 MB
g++	00_small_02.in	AC	4 ms	3 MB
g++	00_small_03.in	AC	5 ms	3 MB
g++	01_medium_00.in	AC	5 ms	3 MB
g++	01_medium_01.in	AC	4 ms	3 MB
g++	01_medium_02.in	AC	4 ms	3 MB
g++	01_medium_03.in	AC	4 ms	3 MB
g++	01_medium_04.in	AC	5 ms	3 MB
g++	01_medium_05.in	AC	5 ms	3 MB
g++	02_large_00.in	AC	5 ms	3 MB
g++	02_large_01.in	AC	4 ms	3 MB
g++	02_large_02.in	AC	5 ms	3 MB
g++	02_large_03.in	AC	4 ms	3 MB
g++	02_large_04.in	AC	4 ms	3 MB
g++	02_large_05.in	AC	5 ms	3 MB
g++	02_large_06.in	AC	5 ms	3 MB
g++	02_large_07.in	AC	5 ms	3 MB
g++	03_critical_00.in	AC	5 ms	3 MB
g++	03_critical_01.in	AC	5 ms	3 MB
g++	03_critical_02.in	AC	5 ms	3 MB
g++	03_critical_03.in	AC	4 ms	3 MB
g++	03_critical_04.in	AC	5 ms	3 MB
g++	03_critical_05.in	AC	4 ms	3 MB
clang++	00_small_00.in	AC	5 ms	3 MB
clang++	00_small_01.in	AC	5 ms	3 MB
clang++	00_small_02.in	AC	4 ms	3 MB
clang++	00_small_03.in	AC	4 ms	3 MB
clang++	01_medium_00.in	AC	4 ms	3 MB
clang++	01_medium_01.in	AC	5 ms	3 MB
clang++	01_medium_02.in	AC	5 ms	3 MB
clang++	01_medium_03.in	AC	5 ms	3 MB
clang++	01_medium_04.in	AC	4 ms	3 MB
clang++	01_medium_05.in	AC	5 ms	3 MB
clang++	02_large_00.in	AC	4 ms	3 MB
clang++	02_large_01.in	AC	5 ms	3 MB
clang++	02_large_02.in	AC	4 ms	3 MB
clang++	02_large_03.in	AC	4 ms	3 MB
clang++	02_large_04.in	AC	5 ms	3 MB
clang++	02_large_05.in	AC	4 ms	3 MB
clang++	02_large_06.in	AC	4 ms	3 MB
clang++	02_large_07.in	AC	4 ms	3 MB
clang++	03_critical_00.in	AC	4 ms	3 MB
clang++	03_critical_01.in	AC	4 ms	3 MB
clang++	03_critical_02.in	AC	4 ms	3 MB
clang++	03_critical_03.in	AC	4 ms	3 MB
clang++	03_critical_04.in	AC	5 ms	3 MB
clang++	03_critical_05.in	AC	4 ms	3 MB

Back to top page