This documentation is automatically generated by competitive-verifier/competitive-verifier
// @brief Bell Number
#define PROBLEM "https://judge.yosupo.jp/problem/bell_number"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include "cp-algo/math/poly.hpp"
#include <bits/stdc++.h>
using namespace std;
using namespace cp_algo::math;
const int mod = 998244353;
using base = modint<mod>;
using polyn = poly_t<base>;
void solve() {
int n;
cin >> n;
(polyn::expx(n+1) - polyn(1)).exp_inplace(n+1).invborel().print(n+1);
}
signed main() {
//freopen("input.txt", "r", stdin);
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
while(t--) {
solve();
}
}
Traceback (most recent call last):
File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj_resolve/resolver.py", line 181, 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 252, in bundle
bundler.update(path)
File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 327, in update
assert len(lines) == len(uncommented_lines)
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
AssertionError
| Env | Name | Status | Elapsed | Memory |
|---|---|---|---|---|
| g++ | 0_00 |
|
10 ms | 8 MB |
| g++ | 100000_00 |
|
89 ms | 24 MB |
| g++ | 10000_00 |
|
22 ms | 11 MB |
| g++ | 1000_00 |
|
14 ms | 10 MB |
| g++ | 100_00 |
|
13 ms | 10 MB |
| g++ | 1_00 |
|
13 ms | 10 MB |
| g++ | 200000_00 |
|
163 ms | 36 MB |
| g++ | 300000_00 |
|
323 ms | 59 MB |
| g++ | 400000_00 |
|
336 ms | 59 MB |
| g++ | 500000_00 |
|
347 ms | 62 MB |
| g++ | example_00 |
|
14 ms | 10 MB |