Binomial coefficients table
(Mylib/Combinatorics/binomial_coefficients_table.cpp)

• View this file on GitHub
• Last update: 2021-04-23 23:44:44+09:00

Operations

• binomial_coefficients_table<T>(int n, int k) -> [[T]]
  • $\binom{0}{0}$ ~ $\binom{n}{k}$を列挙する。
  • Time complexity $O(nk)$

Requirements

Notes

Problems

References

Code

#pragma once
#include <vector>

namespace haar_lib {
  template <typename T>
  auto binomial_coefficients_table(int n, int k) -> std::vector<std::vector<T>> {
    std::vector<std::vector<T>> ret(n + 1, std::vector<T>(k + 1));
    ret[0][0] = 1;

    for (int i = 1; i <= n; ++i) {
      ret[i][0] = 1;

      for (int j = 1; j <= k; ++j) {
        ret[i][j] = ret[i - 1][j - 1] + ret[i - 1][j];
      }
    }

    return ret;
  }
}  // namespace haar_lib

#line 2 "Mylib/Combinatorics/binomial_coefficients_table.cpp"
#include <vector>

namespace haar_lib {
  template <typename T>
  auto binomial_coefficients_table(int n, int k) -> std::vector<std::vector<T>> {
    std::vector<std::vector<T>> ret(n + 1, std::vector<T>(k + 1));
    ret[0][0] = 1;

    for (int i = 1; i <= n; ++i) {
      ret[i][0] = 1;

      for (int j = 1; j <= k; ++j) {
        ret[i][j] = ret[i - 1][j - 1] + ret[i - 1][j];
      }
    }

    return ret;
  }
}  // namespace haar_lib

Back to top page