This documentation is automatically generated by competitive-verifier/competitive-verifier
// @brief Many Factorials
#define PROBLEM "https://judge.yosupo.jp/problem/many_factorials"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define CP_ALGO_CHECKPOINT
#include <bits/stdc++.h>
//#include "blazingio/blazingio.min.hpp"
#include "cp-algo/math/factorials.hpp"
using namespace std;
using base = cp_algo::math::modint<998244353>;
void solve() {
int n;
cin >> n;
cp_algo::big_vector<base> args(n);
for(auto &x : args) {cin >> x;}
cp_algo::checkpoint("read");
auto res = facts<true, 100'000>(args);
for(auto it: res) {cout << it << "\n";}
cp_algo::checkpoint("write");
cp_algo::checkpoint<1>();
}
signed main() {
//freopen("input.txt", "r", stdin);
ios::sync_with_stdio(0);
cin.tie(0);
int t = 1;
//cin >> t;
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++ | example_00 |
|
14 ms | 38 MB |
| g++ | many_bits_00 |
|
77 ms | 39 MB |
| g++ | many_bits_01 |
|
77 ms | 39 MB |
| g++ | many_bits_02 |
|
77 ms | 39 MB |
| g++ | many_bits_03 |
|
77 ms | 39 MB |
| g++ | many_bits_04 |
|
76 ms | 39 MB |
| g++ | near_half_00 |
|
77 ms | 39 MB |
| g++ | near_half_01 |
|
77 ms | 39 MB |
| g++ | near_max_00 |
|
34 ms | 39 MB |
| g++ | near_max_01 |
|
34 ms | 39 MB |
| g++ | random_00 |
|
77 ms | 39 MB |
| g++ | random_01 |
|
79 ms | 39 MB |