math/divisors.cpp

• View this file on GitHub
• Last update: 2022-01-07 21:48:21+09:00

Code

#pragma once
#include <algorithm>
#include <iterator>
#include <vector>

template <class T> std::vector<T> divisors(const T& x) {
    std::vector<T> small, big;
    for (T i = 1; i * i <= x; ++i) {
        if (x % i == 0) {
            small.push_back(i);
            if (i * i != x) big.push_back(x / i);
        }
    }
    small.reserve(small.size() + big.size());
    std::copy(big.rbegin(), big.rend(), std::back_inserter(small));
    return small;
}

#line 2 "math/divisors.cpp"
#include <algorithm>
#include <iterator>
#include <vector>

template <class T> std::vector<T> divisors(const T& x) {
    std::vector<T> small, big;
    for (T i = 1; i * i <= x; ++i) {
        if (x % i == 0) {
            small.push_back(i);
            if (i * i != x) big.push_back(x / i);
        }
    }
    small.reserve(small.size() + big.size());
    std::copy(big.rbegin(), big.rend(), std::back_inserter(small));
    return small;
}

Back to top page