This documentation is automatically generated by competitive-verifier/competitive-verifier
// @brief Consecutive Terms of Linear Recursion
#define PROBLEM "https://judge.yosupo.jp/problem/consecutive_terms_of_linear_recurrent_sequence"
#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 d, M;
int64_t k;
cin >> d >> k >> M;
polyn::Vector a(d), c(d);
copy_n(istream_iterator<base>(cin), d, begin(a));
copy_n(istream_iterator<base>(cin), d, begin(c));
polyn A = polyn(a);
polyn Q = polyn::xk(0) - polyn(c).mul_xk(1);
polyn P = (A * Q).mod_xk(d);
(P * Q.inv(k - d, M + d)).div_xk(d).print(M);
}
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++ | example_00 |
|
4 ms | 4 MB |
| g++ | example_01 |
|
4 ms | 4 MB |
| g++ | example_02 |
|
4 ms | 4 MB |
| g++ | issue_1203_00 |
|
4 ms | 4 MB |
| g++ | max_random_00 |
|
916 ms | 88 MB |
| g++ | max_random_01 |
|
915 ms | 88 MB |
| g++ | max_random_02 |
|
910 ms | 88 MB |
| g++ | near_65536_00 |
|
618 ms | 70 MB |
| g++ | near_65536_01 |
|
654 ms | 68 MB |
| g++ | near_65536_02 |
|
761 ms | 61 MB |
| g++ | random_00 |
|
201 ms | 32 MB |
| g++ | random_01 |
|
712 ms | 54 MB |
| g++ | random_02 |
|
586 ms | 62 MB |
| g++ | small_00 |
|
5 ms | 4 MB |
| g++ | small_01 |
|
4 ms | 4 MB |
| g++ | small_02 |
|
4 ms | 4 MB |
| g++ | small_03 |
|
4 ms | 4 MB |
| g++ | small_04 |
|
4 ms | 4 MB |
| g++ | small_05 |
|
4 ms | 4 MB |
| g++ | small_06 |
|
4 ms | 4 MB |
| g++ | small_07 |
|
4 ms | 4 MB |
| g++ | small_08 |
|
4 ms | 4 MB |
| g++ | small_09 |
|
4 ms | 4 MB |
| g++ | some_param_minimum_00 |
|
4 ms | 4 MB |
| g++ | some_param_minimum_01 |
|
25 ms | 14 MB |
| g++ | some_param_minimum_02 |
|
4 ms | 4 MB |
| g++ | some_param_minimum_03 |
|
306 ms | 23 MB |
| g++ | some_param_minimum_04 |
|
108 ms | 40 MB |
| g++ | some_param_minimum_05 |
|
92 ms | 30 MB |
| g++ | some_param_minimum_06 |
|
59 ms | 20 MB |
| g++ | trailing_zeros_00 |
|
5 ms | 4 MB |
| g++ | trailing_zeros_01 |
|
4 ms | 4 MB |
| g++ | trailing_zeros_02 |
|
4 ms | 4 MB |
| g++ | trailing_zeros_03 |
|
4 ms | 4 MB |
| g++ | trailing_zeros_04 |
|
4 ms | 4 MB |
| g++ | trailing_zeros_05 |
|
4 ms | 4 MB |
| g++ | trailing_zeros_06 |
|
4 ms | 4 MB |
| g++ | trailing_zeros_07 |
|
4 ms | 4 MB |
| g++ | trailing_zeros_08 |
|
4 ms | 4 MB |
| g++ | trailing_zeros_09 |
|
4 ms | 4 MB |
| g++ | zero_00 |
|
4 ms | 4 MB |
| g++ | zero_01 |
|
5 ms | 4 MB |
| g++ | zero_02 |
|
4 ms | 4 MB |