test/verify/yosupo-enumerate-quotients.test.cpp

• View this file on GitHub
• Last update: 2024-07-28 19:56:12+09:00
• Problem: https://judge.yosupo.jp/problem/enumerate_quotients

Depends on

• Enumerate Quotients (商列挙) (math/number-theory/enumerate-quotients.hpp)
• template/template.hpp

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/enumerate_quotients

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

#include "../../math/number-theory/enumerate-quotients.hpp"

int main() {
  int64 n;
  cin >> n;
  auto quotients = enumerate_quotients(n);
  cout << quotients.size() << endl;
  for (auto&& [q, l, r] : quotients) {
    cout << q << " ";
  }
  cout << endl;
}

#line 1 "test/verify/yosupo-enumerate-quotients.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/enumerate_quotients

#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/yosupo-enumerate-quotients.test.cpp"

#line 1 "math/number-theory/enumerate-quotients.hpp"
template <typename T>
vector<tuple<T, T, T> > enumerate_quotients(T n) {
  T l = 1;
  vector<tuple<T, T, T> > quotients;
  while (l <= n) {
    T q = n / l;
    T r = n / q + 1;
    quotients.emplace_back(q, l, r);
    l = r;
  }
  reverse(quotients.begin(), quotients.end());
  return quotients;
}
#line 6 "test/verify/yosupo-enumerate-quotients.test.cpp"

int main() {
  int64 n;
  cin >> n;
  auto quotients = enumerate_quotients(n);
  cout << quotients.size() << endl;
  for (auto&& [q, l, r] : quotients) {
    cout << q << " ";
  }
  cout << endl;
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	5 ms	3 MB
g++	max_00	AC	138 ms	55 MB
g++	min_00	AC	5 ms	3 MB
g++	min_01	AC	4 ms	3 MB
g++	min_02	AC	4 ms	3 MB
g++	min_03	AC	4 ms	3 MB
g++	min_04	AC	4 ms	3 MB
g++	min_05	AC	4 ms	3 MB
g++	min_06	AC	4 ms	3 MB
g++	min_07	AC	4 ms	3 MB
g++	min_08	AC	4 ms	3 MB
g++	polynom_p1p1m1_00	AC	148 ms	55 MB
g++	polynom_p1p1m1_01	AC	63 ms	30 MB
g++	polynom_p1p1z_00	AC	149 ms	55 MB
g++	polynom_p1p1z_01	AC	67 ms	30 MB
g++	polynom_p1zm1_00	AC	150 ms	55 MB
g++	polynom_p1zm1_01	AC	72 ms	30 MB
g++	random_00	AC	75 ms	30 MB
g++	random_01	AC	105 ms	55 MB
g++	random_small_00	AC	6 ms	4 MB
g++	random_small_01	AC	5 ms	4 MB
g++	random_small_02	AC	5 ms	4 MB
g++	random_small_03	AC	5 ms	4 MB
g++	random_small_04	AC	5 ms	4 MB
g++	square_00	AC	62 ms	30 MB
g++	square_01	AC	72 ms	30 MB
clang++	example_00	AC	6 ms	3 MB
clang++	max_00	AC	142 ms	55 MB
clang++	min_00	AC	5 ms	3 MB
clang++	min_01	AC	5 ms	3 MB
clang++	min_02	AC	4 ms	3 MB
clang++	min_03	AC	5 ms	3 MB
clang++	min_04	AC	5 ms	3 MB
clang++	min_05	AC	4 ms	3 MB
clang++	min_06	AC	4 ms	3 MB
clang++	min_07	AC	4 ms	3 MB
clang++	min_08	AC	4 ms	3 MB
clang++	polynom_p1p1m1_00	AC	130 ms	55 MB
clang++	polynom_p1p1m1_01	AC	68 ms	30 MB
clang++	polynom_p1p1z_00	AC	149 ms	55 MB
clang++	polynom_p1p1z_01	AC	63 ms	30 MB
clang++	polynom_p1zm1_00	AC	133 ms	55 MB
clang++	polynom_p1zm1_01	AC	67 ms	30 MB
clang++	random_00	AC	72 ms	30 MB
clang++	random_01	AC	98 ms	55 MB
clang++	random_small_00	AC	6 ms	3 MB
clang++	random_small_01	AC	5 ms	4 MB
clang++	random_small_02	AC	5 ms	4 MB
clang++	random_small_03	AC	5 ms	4 MB
clang++	random_small_04	AC	5 ms	4 MB
clang++	square_00	AC	56 ms	30 MB
clang++	square_01	AC	73 ms	30 MB

Back to top page