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: Rank of Matrix (verify/linalg/rank.test.cpp)

Depends on

Code

// @brief Rank of Matrix
#define PROBLEM "https://judge.yosupo.jp/problem/matrix_rank"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
//#include "blazingio/blazingio.min.hpp"
#include "cp-algo/linalg/matrix.hpp"

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

const int64_t mod = 998244353;
using base = modint<mod>;

void solve() {
    int n, m;
    cin >> n >> m;
    matrix<base> A;
    if(n < m) {
        A = matrix<base>(n, m);
        A.read();
    } else {
        A = matrix<base>(m, n);
        A.read_transposed();
    }
    cout << A.rank() << "\n";
}

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

Test cases

Env Name Status Elapsed Memory
g++ example_00 :heavy_check_mark: AC 6 ms 4 MB
g++ example_01 :heavy_check_mark: AC 5 ms 4 MB
g++ example_02 :heavy_check_mark: AC 5 ms 4 MB
g++ example_03 :heavy_check_mark: AC 5 ms 4 MB
g++ hack_of_system_of_linear_00 :heavy_check_mark: AC 8 ms 4 MB
g++ hack_of_system_of_linear_01 :heavy_check_mark: AC 8 ms 4 MB
g++ hack_of_system_of_linear_02 :heavy_check_mark: AC 8 ms 4 MB
g++ hack_of_system_of_linear_03 :heavy_check_mark: AC 6 ms 4 MB
g++ hack_of_system_of_linear_04 :heavy_check_mark: AC 6 ms 4 MB
g++ hack_of_system_of_linear_05 :heavy_check_mark: AC 7 ms 4 MB
g++ lowrank_00 :heavy_check_mark: AC 25 ms 7 MB
g++ lowrank_01 :heavy_check_mark: AC 25 ms 8 MB
g++ lowrank_02 :heavy_check_mark: AC 15 ms 5 MB
g++ lowrank_03 :heavy_check_mark: AC 26 ms 8 MB
g++ lowrank_04 :heavy_check_mark: AC 7 ms 4 MB
g++ lowrank_05 :heavy_check_mark: AC 12 ms 5 MB
g++ max_00 :heavy_check_mark: AC 23 ms 11 MB
g++ max_01 :heavy_check_mark: AC 22 ms 9 MB
g++ max_02 :heavy_check_mark: AC 22 ms 9 MB
g++ max_03 :heavy_check_mark: AC 33 ms 8 MB
g++ max_04 :heavy_check_mark: AC 33 ms 8 MB
g++ max_05 :heavy_check_mark: AC 34 ms 8 MB
g++ max_06 :heavy_check_mark: AC 22 ms 9 MB
g++ max_07 :heavy_check_mark: AC 22 ms 9 MB
g++ max_08 :heavy_check_mark: AC 24 ms 11 MB
g++ random_00 :heavy_check_mark: AC 24 ms 7 MB
g++ random_01 :heavy_check_mark: AC 25 ms 8 MB
g++ random_02 :heavy_check_mark: AC 14 ms 5 MB
g++ random_03 :heavy_check_mark: AC 25 ms 8 MB
g++ random_04 :heavy_check_mark: AC 7 ms 4 MB
g++ random_05 :heavy_check_mark: AC 12 ms 5 MB
g++ zero_00 :heavy_check_mark: AC 5 ms 4 MB
g++ zero_01 :heavy_check_mark: AC 5 ms 4 MB
g++ zero_02 :heavy_check_mark: AC 7 ms 5 MB
g++ zero_03 :heavy_check_mark: AC 5 ms 4 MB
g++ zero_04 :heavy_check_mark: AC 6 ms 5 MB
Back to top page