algo

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub kuhaku-space/algo

:heavy_check_mark: test/yosupo/enumerative_conbinatorics/bell_number.test.cpp

Depends on

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/bell_number
#include <iostream>
#include "math/bell.hpp"

using Mint = modint998;

int main(void) {
    int n;
    std::cin >> n;
    auto ans = bell<Mint>(n);
    for (int i = 0; i <= n; ++i) std::cout << ans[i] << (i == n ? '\n' : ' ');

    return 0;
}
Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/resolver.py", line 291, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 242, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 479, in update
    self._resolve(pathlib.Path(included), included_from=path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 286, in _resolve
    raise BundleErrorAt(path, -1, "no such header")
competitive_verifier.oj.verify.languages.cplusplus_bundle.BundleErrorAt: math/bell.hpp: line -1: no such header

Test cases

Env Name Status Elapsed Memory
g++ 0_00 :heavy_check_mark: AC 2 ms 3 MB
g++ 100000_00 :heavy_check_mark: AC 267 ms 10 MB
g++ 10000_00 :heavy_check_mark: AC 32 ms 4 MB
g++ 1000_00 :heavy_check_mark: AC 4 ms 4 MB
g++ 100_00 :heavy_check_mark: AC 2 ms 4 MB
g++ 1_00 :heavy_check_mark: AC 2 ms 3 MB
g++ 200000_00 :heavy_check_mark: AC 546 ms 16 MB
g++ 300000_00 :heavy_check_mark: AC 1116 ms 28 MB
g++ 400000_00 :heavy_check_mark: AC 1116 ms 30 MB
g++ 500000_00 :heavy_check_mark: AC 1135 ms 31 MB
g++ example_00 :heavy_check_mark: AC 3 ms 4 MB
Back to top page