約数列挙
(C++/math/divisor.hpp)

• View this file on GitHub
• Last update: 2024-03-29 03:01:20+09:00
• Include: #include "C++/math/divisor.hpp"

Required by

• テンプレート (C++/template.hpp)

Verified with

• test/aarray.test.cpp
• test/add.test.cpp
• test/add128.test.cpp
• test/extgcd.test.cpp
• test/fwtree.test.cpp
• test/m_add.test.cpp
• test/parsum.test.cpp
• test/s_rmq.test.cpp
• test/segtree.test.cpp
• test/sr_sum.test.cpp
• test/stable.test.cpp
• test/uf.test.cpp

Code

#pragma once

#include <vector>
#include <algorithm>
namespace Heileden {
template <class T> inline std::vector<T> div(const T n) {
    std::vector<T> d;
    for(int64_t i = 1; i * i <= n; ++i) {
        if(n % i == 0) {
            d.emplace_back(i);
            if(i * i != n) {
                d.emplace_back(n / i);
            }
        }
    }
    std::ranges::sort(d);
    return d;
}
}

/**
 * @brief 約数列挙
 */

#line 2 "C++/math/divisor.hpp"

#include <vector>
#include <algorithm>
namespace Heileden {
template <class T> inline std::vector<T> div(const T n) {
    std::vector<T> d;
    for(int64_t i = 1; i * i <= n; ++i) {
        if(n % i == 0) {
            d.emplace_back(i);
            if(i * i != n) {
                d.emplace_back(n / i);
            }
        }
    }
    std::ranges::sort(d);
    return d;
}
}

/**
 * @brief 約数列挙
 */

Back to top page