Kth term of Linearly Recurrent Sequence (verify/poly/linrec_single.test.cpp)

• View this file on GitHub
• Last update: 2026-01-06 23:59:05+01:00
• Problem: https://judge.yosupo.jp/problem/kth_term_of_linearly_recurrent_sequence

Depends on

• cp-algo/math/affine.hpp
• cp-algo/math/combinatorics.hpp
• cp-algo/math/common.hpp
• cp-algo/math/cvector.hpp
• cp-algo/math/fft.hpp
• cp-algo/math/poly.hpp
• cp-algo/math/poly/impl/div.hpp
• cp-algo/math/poly/impl/euclid.hpp
• cp-algo/number_theory/discrete_sqrt.hpp
• cp-algo/number_theory/modint.hpp
• cp-algo/random/rng.hpp
• cp-algo/util/big_alloc.hpp
• cp-algo/util/checkpoint.hpp
• cp-algo/util/complex.hpp
• cp-algo/util/simd.hpp

Code

// @brief Kth term of Linearly Recurrent Sequence
#define PROBLEM "https://judge.yosupo.jp/problem/kth_term_of_linearly_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() {
    int64_t d, k;
    cin >> d >> k;
    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 Q = polyn(1) - polyn(c).mul_xk_inplace(1);
    polyn P = (polyn(a) * Q).mod_xk_inplace(d);
    cout << polyn::kth_rec_inplace(P, Q, k) << endl;
}

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

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	5 ms	4 MB
g++	max_random_00	AC	734 ms	20 MB
g++	max_random_01	AC	735 ms	20 MB
g++	max_random_02	AC	729 ms	20 MB
g++	near_65536_00	AC	364 ms	14 MB
g++	near_65536_01	AC	712 ms	18 MB
g++	near_65536_02	AC	716 ms	18 MB
g++	random_00	AC	175 ms	7 MB
g++	random_01	AC	726 ms	19 MB
g++	random_02	AC	355 ms	14 MB
g++	small_00	AC	5 ms	4 MB
g++	small_01	AC	5 ms	4 MB
g++	small_02	AC	5 ms	4 MB
g++	small_03	AC	5 ms	4 MB
g++	small_04	AC	5 ms	4 MB
g++	small_05	AC	5 ms	4 MB
g++	small_06	AC	5 ms	4 MB
g++	small_07	AC	5 ms	4 MB
g++	small_08	AC	5 ms	4 MB
g++	small_09	AC	4 ms	4 MB

Back to top page