1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
/*
 * @uni_kakurenbo
 * https://github.com/uni-kakurenbo/competitive-programming-workspace
 *
 * CC0 1.0  http://creativecommons.org/publicdomain/zero/1.0/deed.ja
 */
/* #language C++ GCC */

#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_A"

#include <cassert><--- Include file:  not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include <ranges><--- Include file:  not found. Please note: Cppcheck does not need standard library headers to get proper results.
#include "snippet/aliases.hpp"
#include "snippet/fast_io.hpp"
#include "adaptor/io.hpp"
#include "adaptor/set.hpp"
#include "numeric/subset_enumerator.hpp"

signed main() {
  print("Hello World");

  REP(n, 25U) {
    uni::unordered_set<uni::u32> st;

    auto enumerator = uni::subset_enumerator(n);

    ITR(v, enumerator) {
      assert(uni::is_subset_of(v, n));
      st.emplace(v);
    }

    ITR(v, enumerator | std::views::reverse) {
      assert(st.contains(v));
    }

    assert(st.ssize() == enumerator.size());
  }
}