combi/bell_number.cpp

• View this file on GitHub
• Last update: 2024-11-24 01:06:04+08:00

Verified with

• test/bell_number.test.cpp

Code

//#include "modint/MontgomeryModInt.cpp"
//#include "poly/NTTmint.cpp"
//#include "poly/FPS.cpp"
//#include "combi/binom.cpp"

template<class Mint>
FPS<Mint> bell_number(int n) {
  binomial<Mint> bn(n);
  FPS<Mint> f(n);
  for(int i = 1; i < n; i++) f[i] = bn.faci(i);
  f = f.exp(n);
  for(int i = 0; i < n; i++) f[i] *= bn.fac(i);
  return f;
}

#line 1 "combi/bell_number.cpp"
//#include "modint/MontgomeryModInt.cpp"
//#include "poly/NTTmint.cpp"
//#include "poly/FPS.cpp"
//#include "combi/binom.cpp"

template<class Mint>
FPS<Mint> bell_number(int n) {
  binomial<Mint> bn(n);
  FPS<Mint> f(n);
  for(int i = 1; i < n; i++) f[i] = bn.faci(i);
  f = f.exp(n);
  for(int i = 0; i < n; i++) f[i] *= bn.fac(i);
  return f;
}

Back to top page