composition_log_1_minus_x.test.cpp

#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#include "my_template.hpp"

#include "random/base.hpp"
#include "poly/composition_f_log_1_minus_x.hpp"
#include "poly/composition.hpp"
#include "mod/modint.hpp"

using mint = modint998;

void test() {
  auto gen = [&](int n) -> vc<mint> {
    vc<mint> f(n + 1);
    FOR(i, n + 1) f[i] = RNG(mint::get_mod());
    return f;
  };
  FOR(n, 100) {
    vc<mint> f = gen(n);
    vc<mint> g(n + 1);
    FOR(i, 1, n + 1) g[i] = -inv<mint>(i);
    vc<mint> F = composition_f_log_1_minus_x(f);
    vc<mint> G = composition(f, g);
    assert(F == G);
  }
}

void solve() {
  int a, b;
  cin >> a >> b;
  cout << a + b << "\n";
}

signed main() {
  test();
  solve();
  return 0;
}