mmrz's library

This documentation is automatically generated by online-judge-tools/verification-helper

---

Project maintained by mm-rz Hosted on GitHub Pages — Theme by mattgraham

約数列挙
(math/enumerate_divisors.hpp)

• View this file on GitHub
• Last update: 2025-07-02 01:37:58+09:00
• Include: #include "math/enumerate_divisors.hpp"

約数列挙

使い方

• vector<T> enumerate_divisors(T n) : $n$ の約数を昇順に列挙したものを返す。素因数分解の計算量を $O(\alpha)$ として、 $O(\alpha + \log(n))$

Depends on

• 素因数分解（ポラード・ロー法） (math/factor.hpp)
• 素数判定（ミラー・ラビン素数判定法） (math/is_prime.hpp)

Verified with

• verify/aoj/id/1642.test.cpp

Code

#pragma once

#include "./factor.hpp"

#include<algorithm>
#include<vector>

template<typename T>
std::vector<T> enumerate_divisors(T n) {
	std::vector<T> ret = {1};

	long long mul = -1;
	long long pre = -1;
	int size_before = 1;

	for(auto p : factor(n)){
		mul = (p == pre ? mul*p : p);
		int sz = (p == pre ? size_before : std::ssize(ret));
		for(int i = 0;i < sz;i++){
			ret.emplace_back(ret[i] * mul);
		}
		pre = p;
		size_before = sz;
	}
	std::sort(ret.begin(), ret.end());
	return ret;
}

#line 2 "math/enumerate_divisors.hpp"

#line 2 "math/factor.hpp"

#line 2 "math/is_prime.hpp"

#include<vector>

__int128_t __power(__int128_t n, __int128_t k, __int128_t m) {
	n %= m;
	__int128_t ret = 1;
	while(k > 0){
		if(k & 1)ret = ret * n % m;
		n = __int128_t(n) * n % m;
		k >>= 1;
	}
	return ret % m;
}

bool is_prime(long long n){
	if(n <= 1)return false;
	if(n == 2 || n == 3 || n == 5)return true;
	if(n % 2 == 0)return false;
	if(n % 3 == 0)return false;
	if(n % 5 == 0)return false;

	std::vector<long long> A = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};

	long long s = 0, d = n - 1;
	while(d % 2 == 0){
		s++;
		d >>= 1;
	}

	for (auto a : A){
		if(a % n == 0)return true;
		long long t, x = __power(a, d, n);
		if(x != 1){
			for(t = 0;t < s;t++){
				if(x == n - 1)break;
				x = __int128_t(x) * x % n;
			}
			if(t == s)return false;
		}
	}
	return true;
}
#line 4 "math/factor.hpp"

#include<algorithm>
#include<numeric>
#line 8 "math/factor.hpp"

long long rho(long long n){
	if(n % 2 == 0)return 2;
	if(is_prime(n))return n;

	auto f = [&](long long x) -> long long {
		return (__int128_t(x) * x + 13) % n;
	};

	long long step = 0;
	while (true) {
		++step;
		long long x = step, y = f(x);
		while (true) {
			long long p = std::gcd(y - x + n, n);
			if (p == 0 || p == n) break;
			if (p != 1) return p;
			x = f(x);
			y = f(f(y));
		}
	}
}

std::vector<long long> factor(long long x){
	if(x == 1)return {};
	long long p = rho(x);
	if(p == x) return {p};
		
	std::vector<long long> l = factor(p);
	std::vector<long long> r = factor(x / p);

	l.insert(l.end(), r.begin(), r.end());
	std::sort(l.begin(), l.end());

	return l;
}
#line 4 "math/enumerate_divisors.hpp"

#line 7 "math/enumerate_divisors.hpp"

template<typename T>
std::vector<T> enumerate_divisors(T n) {
	std::vector<T> ret = {1};

	long long mul = -1;
	long long pre = -1;
	int size_before = 1;

	for(auto p : factor(n)){
		mul = (p == pre ? mul*p : p);
		int sz = (p == pre ? size_before : std::ssize(ret));
		for(int i = 0;i < sz;i++){
			ret.emplace_back(ret[i] * mul);
		}
		pre = p;
		size_before = sz;
	}
	std::sort(ret.begin(), ret.end());
	return ret;
}

Back to top page