順列全探索
(library/search/permutation.hpp)

• View this file on GitHub
• Last update: 2026-01-12 16:39:21+09:00
• Include: #include "library/search/permutation.hpp"

順列全探索

できること

• 順列の全パターンを探索する

計算量

$O(N!)$ Nは10〜12程度まで

使い方

// 関数でbreakしてたらtrue
bool is_loop_break = permutation(A, [&](){
    print(A);
    return true; // trueで探索をbreak
});

Verified with

• 順列全探索のテスト (tests/search.permutation.test.cpp)

Code

#pragma once
template <typename T, typename F> bool permutation(vector<T> &A, F f) {
    sort(begin(A), end(A));
    do {
        if (f()) return true;
    } while (next_permutation(begin(A), end(A)));
    return false;
}

#line 2 "library/search/permutation.hpp"
template <typename T, typename F> bool permutation(vector<T> &A, F f) {
    sort(begin(A), end(A));
    do {
        if (f()) return true;
    } while (next_permutation(begin(A), end(A)));
    return false;
}

Back to top page