Tifa's CP Library

:heavy_check_mark: src/test_cpverifier/unit-test/enum/gosper.cpp

Depends on

Code

#define UNITTEST
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"

#include "../../../code/enum/gosper.hpp"

#include "../../../code/comb/binom.hpp"
#include "../../../code/math/mint_s30.hpp"
#include "../base.hpp"

using mint = tifa_libs::math::mint_s30<998244353>;

template <u32 ID>
void test(u32 n, u32 kmax) {
  using gosper = tifa_libs::gosper<ID>;
  tifa_libs::math::Binom<mint> binom(n);
  for (u32 k = 1; k <= kmax; ++k) {
    gosper::set(n, k);
    gosper gs;
    u32 cnt = 0, cnt_correct = binom.mCn(n, k).val();
    for (auto i : gs) {
      ++cnt;
      check((u32)std::popcount(i), k, check_param(n), check_param(k), check_param(std::bitset<64>(i).to_string()));
    }
    check(cnt, cnt_correct, check_param(n), check_param(k));
  }
}

int main() {
  auto tcase = tifa_libs::unittest::pre_test();

  switch (tcase) {
    case tifa_libs::unittest::ts_example_00: test<1>(1, 1); break;
    case tifa_libs::unittest::ts_example_01: test<1>(2, 2); break;
    case tifa_libs::unittest::ts_random_00: test<1>(3, 3); break;
    case tifa_libs::unittest::ts_random_01: test<1>(4, 4); break;
    case tifa_libs::unittest::ts_random_02: test<1>(5, 5); break;
    case tifa_libs::unittest::ts_random_03: test<1>(6, 6); break;
    case tifa_libs::unittest::ts_random_04: test<2>(10, 10); break;
    case tifa_libs::unittest::ts_random_05: test<2>(20, 20); break;
    case tifa_libs::unittest::ts_random_06: test<2>(30, 10); break;
    case tifa_libs::unittest::ts_random_07: test<2>(40, 8); break;
    case tifa_libs::unittest::ts_random_08: test<2>(50, 7); break;
    case tifa_libs::unittest::ts_random_09: test<2>(60, 6); break;
    default: break;
  }

  tifa_libs::unittest::post_test();
}
#line 1 "src/test_cpverifier/unit-test/enum/gosper.cpp"
#define UNITTEST
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"

#line 1 "src/code/enum/gosper.hpp"



#line 1 "src/code/bit/lowbit.hpp"



#line 1 "src/code/util/util.hpp"



#include <bits/stdc++.h>

template <class T>
constexpr T abs(T x) { return x < 0 ? -x : x; }

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using i128 = __int128_t;
using isz = ptrdiff_t;

using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using u128 = __uint128_t;
using usz = size_t;

using f32 = float;
using f64 = double;
using f128 = long double;

template <class T>
using ptt = std::pair<T, T>;
template <class T>
using pt3 = std::tuple<T, T, T>;
template <class T>
using pt4 = std::tuple<T, T, T, T>;

template <class T, usz N>
using arr = std::array<T, N>;
template <class T>
using vec = std::vector<T>;
template <class T>
using vvec = vec<vec<T>>;
template <class T>
using v3ec = vec<vvec<T>>;
template <class U, class T>
using vecp = vec<std::pair<U, T>>;
template <class U, class T>
using vvecp = vvec<std::pair<U, T>>;
template <class T>
using vecpt = vec<ptt<T>>;
template <class T>
using vvecpt = vvec<ptt<T>>;

template <class T, class C = std::less<T>>
using pq = std::priority_queue<T, vec<T>, C>;
template <class T>
using pqg = std::priority_queue<T, vec<T>, std::greater<T>>;

using strn = std::string;
using strnv = std::string_view;

using vecu = vec<u32>;
using vvecu = vvec<u32>;
using v3ecu = v3ec<u32>;
using vecu64 = vec<u64>;
using vecb = vec<bool>;
using vvecb = vvec<bool>;

#ifdef ONLINE_JUDGE
#undef assert
#define assert(x) 42
#endif

using namespace std::literals;

constexpr i8 operator""_i8(unsigned long long x) { return (i8)x; }
constexpr i16 operator""_i16(unsigned long long x) { return (i16)x; }
constexpr i32 operator""_i32(unsigned long long x) { return (i32)x; }
constexpr i64 operator""_i64(unsigned long long x) { return (i64)x; }
constexpr isz operator""_iz(unsigned long long x) { return (isz)x; }

constexpr u8 operator""_u8(unsigned long long x) { return (u8)x; }
constexpr u16 operator""_u16(unsigned long long x) { return (u16)x; }
constexpr u32 operator""_u32(unsigned long long x) { return (u32)x; }
constexpr u64 operator""_u64(unsigned long long x) { return (u64)x; }
constexpr usz operator""_uz(unsigned long long x) { return (usz)x; }

inline const auto fn_0 = [](auto&&...) {};
inline const auto fn_is0 = [](auto x) { return x == 0; };


#line 5 "src/code/bit/lowbit.hpp"

namespace tifa_libs::bit {

template <class T>
constexpr T lowbit(T x) { return T(1) << std::countr_zero(x); }

}  // namespace tifa_libs::bit


#line 5 "src/code/enum/gosper.hpp"

namespace tifa_libs {

template <u32 = 0>
class gosper {
  static inline u32 n_, k_;
  u64 now_;

  static constexpr u64 num_begin() { return (1_u64 << k_) - 1; }
  static constexpr u64 num_end() { return 1_u64 << n_; }

 public:
  static constexpr void set(u32 n, u32 k) {
    assert(k && k <= n && n < 64);
    n_ = n;
    k_ = k;
  }
  static constexpr gosper begin() { return num_begin(); }
  static constexpr gosper end() { return num_end(); }

  constexpr gosper(u64 now = num_begin()) : now_(std::min(now, num_end())) { assert(now == num_end() || (u32)std::popcount(now) == k_); }

  constexpr u64 operator*() const { return now_; }
  constexpr bool operator!=(gosper const &x) const { return **this != *x; }
  constexpr void operator++() {
    u64 c = bit::lowbit(now_), r = now_ + c;
    now_ = std::min(((r ^ now_) / 4 / c) | r, num_end());
  }
};

}  // namespace tifa_libs


#line 5 "src/test_cpverifier/unit-test/enum/gosper.cpp"

#line 1 "src/code/comb/binom.hpp"



#line 1 "src/code/util/traits.hpp"



#line 5 "src/code/util/traits.hpp"

namespace tifa_libs {

template <class T>
concept iterable_c = requires(T v) {
  { v.begin() } -> std::same_as<typename T::iterator>;
  { v.end() } -> std::same_as<typename T::iterator>;
};

template <class T>
concept container_c = iterable_c<T> && !std::derived_from<T, std::basic_string<typename T::value_type>>;

template <class T>
constexpr bool is_char_v = std::is_same_v<T, char> || std::is_same_v<T, signed char> || std::is_same_v<T, unsigned char>;
template <class T>
concept char_c = is_char_v<T>;

template <class T>
constexpr bool is_s128_v = std::is_same_v<T, __int128_t> || std::is_same_v<T, __int128>;
template <class T>
concept s128_c = is_s128_v<T>;

template <class T>
constexpr bool is_u128_v = std::is_same_v<T, __uint128_t> || std::is_same_v<T, unsigned __int128>;
template <class T>
concept u128_c = is_u128_v<T>;

template <class T>
constexpr bool is_i128_v = is_s128_v<T> || is_u128_v<T>;
template <class T>
concept i128_c = is_u128_v<T>;

template <class T>
constexpr bool is_int_v = std::is_integral_v<T> || is_i128_v<T>;
template <class T>
concept int_c = is_int_v<T>;

template <class T>
constexpr bool is_sint_v = is_s128_v<T> || (is_int_v<T> && std::is_signed_v<T>);
template <class T>
concept sint_c = is_sint_v<T>;

template <class T>
constexpr bool is_uint_v = is_u128_v<T> || (is_int_v<T> && std::is_unsigned_v<T>);
template <class T>
concept uint_c = is_uint_v<T>;

template <class T>
concept mint_c = requires(T x) {
  { x.mod() } -> uint_c;
  { x.val() } -> uint_c;
};

template <class T>
constexpr bool is_arithm_v = std::is_arithmetic_v<T> || is_int_v<T>;
template <class T>
concept arithm_c = is_arithm_v<T>;

template <class T>
struct to_sint : std::make_signed<T> {};
template <>
struct to_sint<u128> {
  using type = u128;
};
template <>
struct to_sint<i128> {
  using type = u128;
};
template <class T>
using to_sint_t = typename to_sint<T>::type;

template <class T>
struct to_uint : std::make_unsigned<T> {};
template <>
struct to_uint<u128> {
  using type = u128;
};
template <>
struct to_uint<i128> {
  using type = u128;
};
template <class T>
using to_uint_t = typename to_uint<T>::type;

}  // namespace tifa_libs


#line 1 "src/code/comb/gen_fact.hpp"



#line 1 "src/code/math/mul_mod_u.hpp"



#line 5 "src/code/math/mul_mod_u.hpp"

namespace tifa_libs::math {

constexpr u64 mul_mod_u(u64 a, u64 b, u64 mod) {
  if (std::bit_width(a) + std::bit_width(b) <= 64) return a * b % mod;
  else return (u64)((u128)a * b % mod);
}

}  // namespace tifa_libs::math


#line 5 "src/code/comb/gen_fact.hpp"

namespace tifa_libs::math {

// i! from i=0..n-1
constexpr vecu64 gen_fact(u32 n, u64 mod) {
  if (n == 0) return {};
  if (n == 1) return {1};
  vecu64 ans(n);
  ans[0] = ans[1] = 1;
  for (u32 i = 2; i < n; ++i) ans[i] = mul_mod_u(ans[i - 1], i, mod);
  return ans;
}
// i! from i=0..n-1
template <class mint>
constexpr vec<mint> gen_fact(u32 n) {
  vec<mint> ans(n);
  auto _ = gen_fact(n, mint::mod());
  for (u32 i = 0; i < n; ++i) ans[i] = _[i];
  return ans;
}

}  // namespace tifa_libs::math


#line 1 "src/code/comb/gen_ifact.hpp"



#line 1 "src/code/comb/gen_inv.hpp"



#line 5 "src/code/comb/gen_inv.hpp"

namespace tifa_libs::math {

// i^{-1} from i=0..n-1
constexpr vecu64 gen_inv(u32 n, u64 mod) {
  if (n == 0) return {};
  if (n == 1) return {1};
  vecu64 ans(n);
  ans[0] = ans[1] = 1;
  for (u32 i = 2; i < n; ++i) ans[i] = mul_mod_u(mod - mod / i, ans[mod % i], mod);
  return ans;
}
// i^{-1} from i=0..n-1
template <class mint>
constexpr vec<mint> gen_inv(u32 n) {
  vec<mint> ans(n);
  auto _ = gen_inv(n, mint::mod());
  for (u32 i = 0; i < n; ++i) ans[i] = _[i];
  return ans;
}

}  // namespace tifa_libs::math


#line 6 "src/code/comb/gen_ifact.hpp"

namespace tifa_libs::math {

// (i!)^{-1} from i=0..n-1
constexpr vecu64 gen_ifact(u32 n, u64 mod, vecu64 inv) {
  for (u32 i = 2; i < n; ++i) inv[i] = mul_mod_u(inv[i], inv[i - 1], mod);
  return inv;
}
// (i!)^{-1} from i=0..n-1
constexpr vecu64 gen_ifact(u32 n, u64 mod) { return gen_ifact(n, mod, gen_inv(n, mod)); }
// (i!)^{-1} from i=0..n-1
template <class mint>
constexpr vec<mint> gen_ifact(u32 n, vec<mint> inv) {
  for (u32 i = 2; i < n; ++i) inv[i] *= inv[i - 1];
  return inv;
}
// (i!)^{-1} from i=0..n-1
template <class mint>
constexpr vec<mint> gen_ifact(u32 n) { return gen_ifact(n, gen_inv<mint>(n)); }

}  // namespace tifa_libs::math


#line 7 "src/code/comb/binom.hpp"

namespace tifa_libs::math {

template <class mint>
struct Binom {
  const vec<mint> fact, ifact;

  explicit constexpr Binom(u32 max_m) : fact(gen_fact<mint>(max_m + 1)), ifact(gen_ifact<mint>(max_m + 1)) {}

  static constexpr u64 mod() { return mint::mod(); }

  // \binom{m}{n}
  template <uint_c T>
  constexpr mint mCn(T m, T n) const { return m < n ? 0 : mPn(m, n) * ifact[(usz)n]; }
  // \binom{m}{n}
  template <sint_c T>
  constexpr mint mCn(T m, T n) const { return m < n || n < 0 ? 0 : mCn(to_uint_t<T>(m), to_uint_t<T>(n)); }

  // \binom{m}{n} * n!
  template <uint_c T>
  constexpr mint mPn(T m, T n) const { return m < n ? 0 : fact[(usz)m] * ifact[(usz)(m - n)]; }
  // \binom{m}{n} * n!
  template <sint_c T>
  constexpr mint mPn(T m, T n) const { return m < n || n < 0 ? 0 : mPn(to_uint_t<T>(m), to_uint_t<T>(n)); }

  // [x^n] 1 / (1-x)^m
  template <uint_c T>
  constexpr mint mHn(T m, T n) const { return n <= 0 ? n == 0 : mCn(m + n - 1, n); }
  // [x^n] 1 / (1-x)^m
  template <sint_c T>
  constexpr mint mHn(T m, T n) const { return m < 0 || n <= 0 ? n == 0 : mHn(to_uint_t<T>(m), to_uint_t<T>(n)); }
};

}  // namespace tifa_libs::math


#line 1 "src/code/math/mint_s30.hpp"



#line 1 "src/code/math/mint.hpp"



#line 1 "src/code/nt/inverse.hpp"



#line 1 "src/code/nt/inv_gcd.hpp"



#line 1 "src/code/math/safe_mod.hpp"



#line 5 "src/code/math/safe_mod.hpp"

namespace tifa_libs::math {

template <sint_c T>
constexpr T safe_mod(T x, to_uint_t<T> mod) { return ((x %= (T)mod) < 0 ? x + (T)mod : x); }

}  // namespace tifa_libs::math


#line 1 "src/code/nt/exgcd.hpp"



#line 5 "src/code/nt/exgcd.hpp"

namespace tifa_libs::math {

// Binary exgcd
template <uint_c U, bool only_x = false>
constexpr auto exgcd_b(U a, U b) {
  using T = to_sint_t<U>;
  if constexpr (only_x) {
    if (!a) return std::make_tuple(b, (T)0);
    if (!b) return std::make_tuple(a, (T)1);
  } else {
    if (!a) return std::make_tuple(b, (T)0, (T) !!b);
    if (!b) return std::make_tuple(a, (T)1, (T)0);
  }
  auto r = std::__countr_zero(a | b);
  a >>= r, b >>= r;
  T x = (T)a, y = (T)b;
  T s = 1, t = 0, u = 0, v = 1;
  while (x) {
    while (!(x & 1)) {
      x /= 2;
      if (!((s | t) & 1)) s /= 2, t /= 2;
      else s = (s + (T)b) / 2, t = (t - (T)a) / 2;
    }
    while (!(y & 1)) {
      y /= 2;
      if (!((u | v) & 1)) u /= 2, v /= 2;
      else u = (u + (T)b) / 2, v = (v - (T)a) / 2;
    }
    if (x >= y) x -= y, s -= u, t -= v;
    else y -= x, u -= s, v -= t;
  }
  if (y > 1) a /= (U)y, b /= (U)y;
  if (a && (U)abs(v) >= a) {
    T _ = v / (T)a;
    v -= _ * (T)a, u += _ * (T)b;
  }
  if (b && (U)abs(u) >= b) {
    T _ = u / (T)b;
    u -= _ * (T)b, v += _ * (T)a;
  }
  if (T u_ = u + (T)b, v_ = v - (T)a; abs(u_) + abs(v_) <= abs(u) + abs(v)) u = u_, v = v_;
  if (T u_ = u - (T)b, v_ = v + (T)a; abs(u_) + abs(v_) <= abs(u) + abs(v)) u = u_, v = v_;
  if constexpr (only_x) return std::make_tuple(U(y << r), u);
  else return std::make_tuple(U(y << r), u, v);
}
// @return then return tuple(g, x[, y]) s.t. g = gcd(a, b), xa + yb = g, |x| + |y| is the minimal (primary) and x <= y (secondarily)
template <sint_c T, bool only_x = false>
constexpr auto exgcd(T a, T b) {
  using U = to_uint_t<T>;
  if (auto [x, y] = std::minmax(a, b); x >= 0 && y <= T(U(-1) >> sizeof(U))) return exgcd_b<U, only_x>((U)a, (U)b);
  if constexpr (only_x) {
    T s = 1, u = 0;
    while (b) {
      T c = a / b;
      std::tie(s, u, a, b) = std::make_tuple(u, s - u * c, b, a - b * c);
    }
    return std::make_tuple((U)a, s);
  } else {
    T s = 1, t = 0, u = 0, v = 1;
    while (b) {
      T c = a / b;
      std::tie(s, t, u, v, a, b) = std::make_tuple(u, v, s - u * c, t - v * c, b, a - b * c);
    }
    return std::make_tuple((U)a, s, t);
  }
}

}  // namespace tifa_libs::math


#line 6 "src/code/nt/inv_gcd.hpp"

namespace tifa_libs::math {

template <uint_c T>
constexpr ptt<T> inv_gcd(T n, T mod) {
  using U = to_sint_t<T>;
  auto [g, x] = exgcd<U, true>(U(n % mod), (U)mod);
  return {g, safe_mod(x, mod)};
}

}  // namespace tifa_libs::math


#line 5 "src/code/nt/inverse.hpp"

namespace tifa_libs::math {

template <uint_c T, uint_c U>
constexpr U inverse(T n, U mod) {
  auto [g, x] = inv_gcd(U(n % mod), mod);
  assert(g == 1);
  return x;
}

}  // namespace tifa_libs::math


#line 6 "src/code/math/mint.hpp"

namespace tifa_libs::math {

template <class D, uint_c Rt>
class mint {
  constexpr D const &d() const { return static_cast<D const &>(*this); }
  constexpr D &d() { return static_cast<D &>(*this); }

 protected:
  Rt v_{};

 public:
  constexpr mint() {}
  template <int_c T>
  constexpr mint(T v) : v_(D::mod_(v)) {}
  constexpr operator D() { return d(); }

  using raw_type = Rt;
  using sraw_type = to_sint_t<Rt>;
  static constexpr raw_type mod() { return D::mod_(); }
  static constexpr sraw_type smod() { return (sraw_type)D::mod_(); }
  constexpr raw_type val() const { return d().val_(); }
  constexpr sraw_type sval() const { return (sraw_type)d().val_(); }
  constexpr raw_type &data() { return d().data_(); }

  template <int_c T>
  explicit constexpr operator T() const { return (T)val(); }
  constexpr mint &operator+=(mint const &r) { return d().adde_(r.d()); }
  constexpr mint &operator-=(mint const &r) { return d().sube_(r.d()); }
  constexpr mint &operator*=(mint const &r) { return d().mule_(r.d()); }
  constexpr mint &operator/=(mint const &r) { return *this = *this * r.inv(); }
  constexpr mint const &operator+() const { return *this; }
  constexpr mint operator-() const { return d().neg_(); }
  constexpr mint inv() const { return inverse(val(), mod()); }
  friend constexpr mint operator+(mint l, mint const &r) { return l += r; }
  friend constexpr mint operator-(mint l, mint const &r) { return l -= r; }
  friend constexpr mint operator*(mint l, mint const &r) { return l *= r; }
  friend constexpr mint operator/(mint l, mint const &r) { return l /= r; }
  friend constexpr bool operator==(mint const &l, mint const &r) { return l.val() == r.val(); }
  friend constexpr auto operator<=>(mint const &l, mint const &r) { return l.sval() - r.sval(); }
  friend std::istream &operator>>(std::istream &is, mint &x) {
    i64 _;
    is >> _;
    x = mint(_);
    return is;
  }
  friend std::ostream &operator<<(std::ostream &os, mint const &x) { return os << x.val(); }
  friend constexpr mint abs(mint const &x) { return x.val(); }
};

}  // namespace tifa_libs::math


#line 5 "src/code/math/mint_s30.hpp"

namespace tifa_libs::math {

template <u32 MOD>
class mint_s30 : public mint<mint_s30<MOD>, u32> {
  using base = mint<mint_s30<MOD>, u32>;
  friend base;

  static constexpr u32 MOD2 = MOD << 1;
  static constexpr u32 R = []() {
    u32 t = 2, iv = MOD * (t - MOD * MOD);
    iv *= t - MOD * iv, iv *= t - MOD * iv;
    return iv * (MOD * iv - t);
  }();
  static constexpr u32 R2 = -(u64)(MOD) % MOD;

  static_assert(MOD & 1);
  static_assert(-R * MOD == 1);
  static_assert((MOD >> 30) == 0);
  static_assert(MOD != 1);

  static constexpr u32 reduce(u64 x) { return u32((x + u64((u32)x * R) * MOD) >> 32); }
  static constexpr u32 norm(u32 x) { return x - (MOD & -((MOD - 1 - x) >> 31)); }

 public:
  static constexpr bool FIXED_MOD = true;
  constexpr mint_s30() {}
  template <int_c T>
  constexpr mint_s30(T v) { this->v_ = mod_(v); }

 private:
  using raw_t = typename base::raw_type;
  using sraw_t = typename base::sraw_type;
  template <sint_c T>
  static constexpr raw_t mod_(T v) { return reduce(u64(v % (i32)mod_() + (i32)mod_()) * R2); }
  template <uint_c T>
  static constexpr raw_t mod_(T v) { return reduce(u64(v % mod_()) * R2); }
  static constexpr raw_t mod_() { return MOD; }
  constexpr raw_t val_() const { return norm(reduce(this->v_)); }
  constexpr raw_t &data_() { return this->v_; }

  constexpr mint_s30 neg_() const {
    mint_s30 res;
    res.v_ = (MOD2 & -(this->v_ != 0)) - this->v_;
    return res;
  }
  constexpr mint_s30 &adde_(mint_s30 const &r) {
    this->v_ += r.v_ - MOD2, this->v_ += MOD2 & -(this->v_ >> 31);
    return *this;
  }
  constexpr mint_s30 &sube_(mint_s30 const &r) {
    this->v_ -= r.v_, this->v_ += MOD2 & -(this->v_ >> 31);
    return *this;
  }
  constexpr mint_s30 &mule_(mint_s30 const &r) {
    this->v_ = reduce(u64(this->v_) * r.v_);
    return *this;
  }
};

}  // namespace tifa_libs::math


#line 1 "src/test_cpverifier/unit-test/base.hpp"



#line 1 "src/code/io/ios128.hpp"



#line 5 "src/code/io/ios128.hpp"

inline std::istream &operator>>(std::istream &is, i128 &n) {
  bool neg = false;
  while (!neg && !isdigit(is.peek())) {
    if (is.peek() == '-') neg = true;
    is.get();
  }
  n = 0;
  while (isdigit(is.peek())) (n *= 10) += is.get() & 15;
  if (neg) n = -n;
  return is;
}
inline std::istream &operator>>(std::istream &is, u128 &n) {
  while (!isdigit(is.peek())) is.get();
  n = 0;
  while (isdigit(is.peek())) (n *= 10) += is.get() & 15;
  return is;
}
inline std::ostream &operator<<(std::ostream &os, u128 n) {
  if (n > 9) os << n / 10;
  os << (uint_fast32_t)(n % 10);
  return os;
}
inline std::ostream &operator<<(std::ostream &os, i128 n) {
  if (n < 0) {
    os << '-';
    n = -n;
  }
  return os << (u128)n;
}


#line 1 "src/code/io/ios_container.hpp"



#line 5 "src/code/io/ios_container.hpp"

template <tifa_libs::container_c T>
std::istream &operator>>(std::istream &is, T &x) {
  for (auto &i : x) is >> i;
  return is;
}
template <tifa_libs::container_c T>
std::ostream &operator<<(std::ostream &os, T const &x) {
  if (x.begin() == x.end()) return os;
  auto it = x.begin();
  os << *it++;
  for (; it != x.end(); ++it) os << ' ' << *it;
  return os;
}


#line 1 "src/code/io/ios_pair.hpp"



#line 5 "src/code/io/ios_pair.hpp"

template <class T, class U>
std::istream &operator>>(std::istream &is, std::pair<T, U> &p) { return is >> p.first >> p.second; }
template <class T, class U>
std::ostream &operator<<(std::ostream &os, std::pair<T, U> const &p) { return os << p.first << ' ' << p.second; }


#line 1 "src/code/io/ios_tuple.hpp"



#line 5 "src/code/io/ios_tuple.hpp"

template <class... Ts>
std::istream &operator>>(std::istream &is, std::tuple<Ts...> &p) {
  std::apply([&](Ts &...targs) { ((is >> targs), ...); }, p);
  return is;
}
template <class... Ts>
std::ostream &operator<<(std::ostream &os, std::tuple<Ts...> const &p) {
  std::apply(
      [&](Ts const &...targs) {
        usz n = 0;
        ((os << targs << (++n != sizeof...(Ts) ? " " : "")), ...);
      },
      p);
  return os;
}


#line 1 "src/code/rand/gen.hpp"



#line 5 "src/code/rand/gen.hpp"

namespace tifa_libs::rand {

template <class Distri>
class Gen {
  std::conditional_t<sizeof(typename Distri::result_type) <= 4, std::mt19937, std::mt19937_64> re;
  Distri dist;

 public:
  using random_engine = decltype(re);
  using distribution = Distri;
  using result_type = typename Distri::result_type;

  constexpr Gen() : re(std::random_device{}()), dist() {}
  constexpr Gen(result_type a, result_type b) : re(std::random_device{}()), dist(a, b) {}

  constexpr void set_range(result_type a, result_type b) { dist = Distri(a, b); }
  constexpr random_engine& rand_eng() { return re; }
  constexpr Distri& distrib() { return dist; }

  void reset_seed() { re.seed((result_type)std::chrono::duration_cast<std::conditional_t<sizeof(typename Distri::result_type) <= 4, std::chrono::seconds, std::chrono::nanoseconds>>(std::chrono::high_resolution_clock::now().time_since_epoch()).count()); }
  constexpr result_type operator()() { return dist(re); }
  result_type next() { return dist(re); }
};

}  // namespace tifa_libs::rand


#line 10 "src/test_cpverifier/unit-test/base.hpp"

namespace tifa_libs::unittest {

namespace detail__ {

template <class T>
strn to_str(T const &x) {
  std::stringstream ss;
  ss << std::fixed << std::setprecision(12) << x;
  return ss.str();
}

template <class T, class... Ts>
void check_(strn const &pretty_func, strn const &got_str, T const &got, strn const &want_str, T const &want, Ts... param) {
  if constexpr (sizeof...(param) == 0) {
    if (got != want) throw std::runtime_error(pretty_func + ": got \"" + got_str + "\" = " + to_str(got) + ", want \"" + want_str + "\" = " + to_str(want));
  } else {
    if (got != want) throw std::runtime_error(pretty_func + ": got \"" + got_str + "\" = " + to_str(got) + ", want \"" + want_str + "\" = " + to_str(want) + " with" + ((" " + param.first + " = " + ::tifa_libs::unittest::detail__::to_str(param.second) + " ;") + ...));
  }
}

template <class... Ts>
void check_bool_(strn const &pretty_func, strn const &expression, bool res, Ts... param) {
  if constexpr (sizeof...(param) == 0) {
    if (!res) throw std::runtime_error(pretty_func + " :\"" + expression + "\" failed");
  } else {
    if (!res) throw std::runtime_error(pretty_func + " :\"" + expression + "\" failed with" + ((" " + param.first + " = " + ::tifa_libs::unittest::detail__::to_str(param.second) + " ;") + ...));
  }
}

}  // namespace detail__

enum TESTCASE { ts_local,
                ts_example_00,
                ts_example_01,
                ts_random_00,
                ts_random_01,
                ts_random_02,
                ts_random_03,
                ts_random_04,
                ts_random_05,
                ts_random_06,
                ts_random_07,
                ts_random_08,
                ts_random_09 };

inline const std::map<ptt<u32>, TESTCASE> testcase_id{
    {{1234, 5678}, ts_example_00},
    {{1000000000, 1000000000}, ts_example_01},
    {{192279220, 156648746}, ts_random_00},
    {{264704197, 120999146}, ts_random_01},
    {{682152023, 451794314}, ts_random_02},
    {{627477696, 504915182}, ts_random_03},
    {{729561619, 415335212}, ts_random_04},
    {{173330281, 220603612}, ts_random_05},
    {{841413509, 58432763}, ts_random_06},
    {{251229786, 256388306}, ts_random_07},
    {{118232767, 222490630}, ts_random_08},
    {{907649120, 290651129}, ts_random_09}};

inline void post_test([[maybe_unused]] ptt<u32> const &p = {0, 0}) {
#ifndef LOCAL_
  static ptt<u32> p_{0, 0};
  if (p.first || p.second) {
    p_ = p;
    return;
  }
  std::cout << p_.first + p_.second << '\n';
  exit(0);
#endif
}

inline TESTCASE pre_test() {
#ifndef LOCAL_
  ptt<u32> p;
  std::cin >> p.first >> p.second;
  post_test(p);
  return testcase_id.at(p);
#else
  return ts_local;
#endif
}

#define check(got, want, ...) ::tifa_libs::unittest::detail__::check_(__PRETTY_FUNCTION__, #got, got, #want, want __VA_OPT__(, ) __VA_ARGS__)
#define check_bool(expression, ...) ::tifa_libs::unittest::detail__::check_bool_(__PRETTY_FUNCTION__, #expression, expression __VA_OPT__(, ) __VA_ARGS__)
#define check_param(x) \
  std::pair<std::string, decltype(x)> { #x " = ", x }

}  // namespace tifa_libs::unittest


#line 9 "src/test_cpverifier/unit-test/enum/gosper.cpp"

using mint = tifa_libs::math::mint_s30<998244353>;

template <u32 ID>
void test(u32 n, u32 kmax) {
  using gosper = tifa_libs::gosper<ID>;
  tifa_libs::math::Binom<mint> binom(n);
  for (u32 k = 1; k <= kmax; ++k) {
    gosper::set(n, k);
    gosper gs;
    u32 cnt = 0, cnt_correct = binom.mCn(n, k).val();
    for (auto i : gs) {
      ++cnt;
      check((u32)std::popcount(i), k, check_param(n), check_param(k), check_param(std::bitset<64>(i).to_string()));
    }
    check(cnt, cnt_correct, check_param(n), check_param(k));
  }
}

int main() {
  auto tcase = tifa_libs::unittest::pre_test();

  switch (tcase) {
    case tifa_libs::unittest::ts_example_00: test<1>(1, 1); break;
    case tifa_libs::unittest::ts_example_01: test<1>(2, 2); break;
    case tifa_libs::unittest::ts_random_00: test<1>(3, 3); break;
    case tifa_libs::unittest::ts_random_01: test<1>(4, 4); break;
    case tifa_libs::unittest::ts_random_02: test<1>(5, 5); break;
    case tifa_libs::unittest::ts_random_03: test<1>(6, 6); break;
    case tifa_libs::unittest::ts_random_04: test<2>(10, 10); break;
    case tifa_libs::unittest::ts_random_05: test<2>(20, 20); break;
    case tifa_libs::unittest::ts_random_06: test<2>(30, 10); break;
    case tifa_libs::unittest::ts_random_07: test<2>(40, 8); break;
    case tifa_libs::unittest::ts_random_08: test<2>(50, 7); break;
    case tifa_libs::unittest::ts_random_09: test<2>(60, 6); break;
    default: break;
  }

  tifa_libs::unittest::post_test();
}

Test cases

Env Name Status Elapsed Memory
g++-12 example_00 :heavy_check_mark: AC 8 ms 4 MB
g++-12 example_01 :heavy_check_mark: AC 7 ms 4 MB
g++-12 random_00 :heavy_check_mark: AC 7 ms 4 MB
g++-12 random_01 :heavy_check_mark: AC 7 ms 4 MB
g++-12 random_02 :heavy_check_mark: AC 7 ms 4 MB
g++-12 random_03 :heavy_check_mark: AC 7 ms 4 MB
g++-12 random_04 :heavy_check_mark: AC 7 ms 4 MB
g++-12 random_05 :heavy_check_mark: AC 92 ms 4 MB
g++-12 random_06 :heavy_check_mark: AC 4240 ms 4 MB
g++-12 random_07 :heavy_check_mark: AC 7597 ms 4 MB
g++-12 random_08 :heavy_check_mark: AC 14047 ms 4 MB
g++-12 random_09 :heavy_check_mark: AC 4128 ms 4 MB
Back to top page