This documentation is automatically generated by online-judge-tools/verification-helper
#include "math/divisors.hpp"divisors(factors): 素因数分解 factors が表す整数の約数を昇順に返す。factors は factorize(n) か sieve::factorize(x) の結果。#pragma once
#include <algorithm>
#include <utility>
#include <vector>
template <class T>
std::vector<T> divisors(const std::vector<std::pair<T, int>>& factors) {
std::vector<T> ret = {1};
for (auto [p, e] : factors) {
int sz = int(ret.size());
T q = 1;
for (int i = 0; i < e; i++) {
q *= p;
for (int j = 0; j < sz; j++) ret.push_back(ret[j] * q);
}
}
std::ranges::sort(ret);
return ret;
}#line 2 "math/divisors.hpp"
#include <algorithm>
#include <utility>
#include <vector>
template <class T>
std::vector<T> divisors(const std::vector<std::pair<T, int>>& factors) {
std::vector<T> ret = {1};
for (auto [p, e] : factors) {
int sz = int(ret.size());
T q = 1;
for (int i = 0; i < e; i++) {
q *= p;
for (int j = 0; j < sz; j++) ret.push_back(ret[j] * q);
}
}
std::ranges::sort(ret);
return ret;
}