素因数分解
(C++/math/primefactor.hpp)

• View this file on GitHub
• Last update: 2024-03-29 03:01:20+09:00
• Include: #include "C++/math/primefactor.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 <utility>
namespace Heileden {
template <class T> inline std::vector<std::pair<T, int>> prmfct(T n) {
    std::vector<std::pair<T, int>> res;
    for(int64_t i = 2; i * i <= n; ++i) {
        if(n % i != 0) {
            continue;
        }
        int tmp = 0;
        while(n % i == 0) {
            tmp++;
            n /= i;
        }
        res.emplace_back(i, tmp);
    }
    if(n != 1) {
        res.emplace_back(n, 1);
    }
    return res;
}
}

/**
 * @brief 素因数分解
 */

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

#include <vector>
#include <utility>
namespace Heileden {
template <class T> inline std::vector<std::pair<T, int>> prmfct(T n) {
    std::vector<std::pair<T, int>> res;
    for(int64_t i = 2; i * i <= n; ++i) {
        if(n % i != 0) {
            continue;
        }
        int tmp = 0;
        while(n % i == 0) {
            tmp++;
            n /= i;
        }
        res.emplace_back(i, tmp);
    }
    if(n != 1) {
        res.emplace_back(n, 1);
    }
    return res;
}
}

/**
 * @brief 素因数分解
 */

Back to top page