CP-Algorithms Library

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

View the Project on GitHub cp-algorithms/cp-algorithms-aux

:heavy_check_mark: Pow of Matrix (verify/linalg/pow.test.cpp)

Depends on

Code

// @brief Pow of Matrix
#define PROBLEM "https://judge.yosupo.jp/problem/pow_of_matrix"
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("tune=native")
#include "cp-algo/linalg/matrix.hpp"
#include <bits/stdc++.h>

using namespace std;
using namespace cp_algo::linalg;
using namespace cp_algo::math;

const int64_t mod = 998244353;

void solve() {
    int n;
    uint64_t k;
    cin >> n >> k;
    matrix<modint<mod>> a(n, n);
    a.read();
    a.pow(k).print();
}

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 :heavy_check_mark: AC 5 ms 4 MB
g++ example_01 :heavy_check_mark: AC 4 ms 4 MB
g++ example_02 :heavy_check_mark: AC 4 ms 4 MB
g++ frobenius_hack_00 :heavy_check_mark: AC 5 ms 4 MB
g++ lowrank_max_random_00 :heavy_check_mark: AC 127 ms 5 MB
g++ lowrank_max_random_01 :heavy_check_mark: AC 117 ms 5 MB
g++ max_random_00 :heavy_check_mark: AC 127 ms 6 MB
g++ max_random_01 :heavy_check_mark: AC 126 ms 6 MB
g++ max_random_02 :heavy_check_mark: AC 132 ms 6 MB
g++ max_random_03 :heavy_check_mark: AC 129 ms 6 MB
g++ max_random_worst_00 :heavy_check_mark: AC 164 ms 6 MB
g++ max_random_worst_01 :heavy_check_mark: AC 168 ms 6 MB
g++ max_random_worst_02 :heavy_check_mark: AC 171 ms 5 MB
g++ max_random_worst_03 :heavy_check_mark: AC 163 ms 6 MB
g++ nontrivial_frobenius_form_00 :heavy_check_mark: AC 37 ms 6 MB
g++ nontrivial_frobenius_form_01 :heavy_check_mark: AC 130 ms 5 MB
g++ nontrivial_frobenius_form_02 :heavy_check_mark: AC 133 ms 6 MB
g++ nontrivial_frobenius_form_03 :heavy_check_mark: AC 123 ms 6 MB
g++ nontrivial_frobenius_form_04 :heavy_check_mark: AC 116 ms 6 MB
g++ nontrivial_frobenius_form_05 :heavy_check_mark: AC 122 ms 5 MB
g++ nontrivial_frobenius_form_06 :heavy_check_mark: AC 125 ms 6 MB
g++ nontrivial_frobenius_form_07 :heavy_check_mark: AC 116 ms 5 MB
g++ nontrivial_frobenius_form_08 :heavy_check_mark: AC 133 ms 5 MB
g++ nontrivial_frobenius_form_09 :heavy_check_mark: AC 130 ms 6 MB
g++ perm_max_random_00 :heavy_check_mark: AC 38 ms 5 MB
g++ perm_max_random_01 :heavy_check_mark: AC 34 ms 5 MB
g++ random_00 :heavy_check_mark: AC 108 ms 5 MB
g++ random_01 :heavy_check_mark: AC 124 ms 5 MB
g++ random_02 :heavy_check_mark: AC 20 ms 4 MB
g++ signed_overflow_00 :heavy_check_mark: AC 7 ms 4 MB
g++ small_00 :heavy_check_mark: AC 5 ms 4 MB
g++ small_01 :heavy_check_mark: AC 4 ms 4 MB
g++ small_02 :heavy_check_mark: AC 4 ms 4 MB
g++ small_03 :heavy_check_mark: AC 4 ms 4 MB
g++ small_04 :heavy_check_mark: AC 4 ms 4 MB
g++ small_05 :heavy_check_mark: AC 4 ms 4 MB
g++ small_06 :heavy_check_mark: AC 4 ms 4 MB
g++ small_07 :heavy_check_mark: AC 4 ms 4 MB
g++ small_08 :heavy_check_mark: AC 5 ms 4 MB
g++ small_09 :heavy_check_mark: AC 5 ms 4 MB
g++ small_10 :heavy_check_mark: AC 5 ms 4 MB
g++ small_11 :heavy_check_mark: AC 5 ms 4 MB
g++ unsigned_overflow_00 :heavy_check_mark: AC 5 ms 4 MB
Back to top page