graph/count/count_labeled_tree.hpp

• View this file on GitHub
• Last update: 2024-01-30 02:35:00+09:00
• Include: #include "graph/count/count_labeled_tree.hpp"
• Link: https://oeis.org/A000272

Required by

• graph/count/count_labeled_forest.hpp

Verified with

• test/mytest/count_labeled_forest.test.cpp
• test/mytest/graph_count.test.cpp

Code

#pragma once

// https://oeis.org/A000272
template <typename mint>
vc<mint> count_labeled_tree(ll nmax) {
  vc<mint> f(nmax + 1);
  FOR(n, 1, nmax + 1) { f[n] = (n == 1 ? mint(1) : mint(n).pow(n - 2)); }
  return f;
}

#line 2 "graph/count/count_labeled_tree.hpp"

// https://oeis.org/A000272
template <typename mint>
vc<mint> count_labeled_tree(ll nmax) {
  vc<mint> f(nmax + 1);
  FOR(n, 1, nmax + 1) { f[n] = (n == 1 ? mint(1) : mint(n).pow(n - 2)); }
  return f;
}

Back to top page