test/utility/next_combination.test.cpp

• View this file on GitHub
• Last update: 2025-11-15 20:52:05+09:00
• Link: https://yukicoder.me/problems/no/2561

Depends on

• Fenwick Tree (data_structure/fenwick_tree.hpp)
• Merge Sort Tree (data_structure/merge_sort_tree.hpp)
• Ordered Map and Range Query (data_structure/ordered_map_and_range_query.hpp)
• Rollback Union Find (Rollback付きUnion Find) (data_structure/rollback_union_find.hpp)
• Segment Tree (セグメント木) (data_structure/segment_tree.hpp)
• Union Find (data_structure/union_find.hpp)
• Weighted Union Find (重み付きUnion Find) (data_structure/weighted_union_find.hpp)
• Low Link (graph/low_link.hpp)
• Topological Sort (トポロジカルソート) (graph/topological_sort.hpp)
• Binomial (二項係数) (math/binomial.hpp)
• Dynamic Mod Int (math/dynamic_mod_int.hpp)
• Extended Euclidean Algorithm (拡張ユークリッドの互除法) (math/extended_gcd.hpp)
• Matrix (行列) (math/matrix.hpp)
• Next Combination (math/next_combination.hpp)
• Prime Sieve (エラトステネスの篩) (math/prime_sieve.hpp)
• Static Mod Int (math/static_mod_int.hpp)
• Rolling Hash (ローリングハッシュ) (string/rolling_hash.hpp)
• template/constant.hpp
• template/include.hpp
• template/macro.hpp
• 提出用テンプレート (template/template.hpp)
• template/type_alias.hpp
• test/aoj/2426.test.cpp
• test/aoj/DSL_2_F.test.cpp
• test/aoj/DSL_2_H.test.cpp
• test/aoj/GRL_3_A.test.cpp
• test/aoj/GRL_3_B.test.cpp
• test/data_structure/fenwick_tree.test.cpp
• test/data_structure/rollback_union_find.test.cpp
• test/data_structure/segment_tree.range_min.test.cpp
• test/data_structure/unionfind.test.cpp
• test/data_structure/weighted_union_find.test.cpp
• test/graph/topological_sort.get.test.cpp
• test/graph/topological_sort.is_dag.test.cpp
• test/math/binomial.test.cpp
• test/math/extended_gcd.test.cpp
• test/math/matrix.test.cpp
• test/math/prime_sieve.test.cpp
• test/string/rolling_hash.test.cpp
• test/template/template.test.cpp
• test/tree/heavy_light_decomposition.lca.test.cpp
• test/tree/heavy_light_decomposition.path_query.test.cpp
• test/tree/heavy_light_decomposition.subtree_query.test.cpp
• Heavy Light Decomposition (HL分解) (tree/heavy_light_decomposition.hpp)
• Choose Minimum / Maximum (utility/choose_min_max.hpp)
• utility/set_io.hpp

Code

#define PROBLEM "https://yukicoder.me/problems/no/2561"

#include "../../other/next_combination.hpp"
#include "../../template/template.hpp"

int main() {
    set_io();

    int N, K;
    cin >> N >> K;

    vector<ll> A(N);
    rep (i, 0, N) {
        cin >> A[i];
    }

    vector<int> id(N);
    iota(all(id), 0);

    int ans = 0;
    do {
        ll s1 = 0, s2 = 0;
        rep (i, 0, K) {
            s1 = (s1 + A[id[i]]) % 998;
            s2 = (s2 + A[id[i]]) % 998244353;
        }

        if (s2 <= s1) {
            ans = (ans + 1) % 998;
        }
    } while (next_combination(id.begin(), id.end(), K));

    cout << ans << LF;

    return 0;
}

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj_resolve/resolver.py", line 181, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 483, in update
    self._resolve(pathlib.Path(included), included_from=path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 291, in _resolve
    raise BundleErrorAt(path, -1, "no such header")
competitive_verifier.oj.verify.languages.cplusplus_bundle.BundleErrorAt: ../../other/next_combination.hpp: line -1: no such header

Back to top page