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: System of Linear Equations (verify/linalg/system.test.cpp)

Depends on

Code

// @brief System of Linear Equations
#define PROBLEM "https://judge.yosupo.jp/problem/system_of_linear_equations"
#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::linalg;
using namespace cp_algo::math;

const int64_t mod = 998244353;

void solve() {
    int n, m;
    cin >> n >> m;
    matrix<modint<mod>> A(n, m), b(n, 1);
    A.read();
    b.read();
    auto x = A.solve(b);
    if(!x) {
        cout << -1 << "\n";
    } else {
        auto [sol, basis] = *x;
        cout << basis.n() << "\n";
        sol.print();
        basis.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++ fullrank_00 :heavy_check_mark: AC 14 ms 6 MB
g++ fullrank_01 :heavy_check_mark: AC 14 ms 6 MB
g++ fullrank_02 :heavy_check_mark: AC 10 ms 5 MB
g++ fullrank_no_solution_00 :heavy_check_mark: AC 14 ms 6 MB
g++ fullrank_no_solution_01 :heavy_check_mark: AC 14 ms 6 MB
g++ fullrank_no_solution_02 :heavy_check_mark: AC 9 ms 5 MB
g++ hack_00 :heavy_check_mark: AC 17 ms 7 MB
g++ hack_01 :heavy_check_mark: AC 12 ms 5 MB
g++ hack_02 :heavy_check_mark: AC 15 ms 6 MB
g++ hack_03 :heavy_check_mark: AC 6 ms 4 MB
g++ hack_04 :heavy_check_mark: AC 10 ms 5 MB
g++ hack_05 :heavy_check_mark: AC 14 ms 6 MB
g++ lowrank_00 :heavy_check_mark: AC 30 ms 9 MB
g++ lowrank_01 :heavy_check_mark: AC 33 ms 9 MB
g++ lowrank_02 :heavy_check_mark: AC 23 ms 10 MB
g++ lowrank_03 :heavy_check_mark: AC 35 ms 11 MB
g++ lowrank_04 :heavy_check_mark: AC 26 ms 9 MB
g++ lowrank_05 :heavy_check_mark: AC 34 ms 10 MB
g++ max_00 :heavy_check_mark: AC 44 ms 10 MB
g++ max_01 :heavy_check_mark: AC 42 ms 10 MB
g++ max_02 :heavy_check_mark: AC 41 ms 10 MB
g++ random_00 :heavy_check_mark: AC 14 ms 5 MB
g++ random_01 :heavy_check_mark: AC 11 ms 5 MB
g++ random_02 :heavy_check_mark: AC 14 ms 6 MB
g++ random_03 :heavy_check_mark: AC 11 ms 5 MB
g++ random_04 :heavy_check_mark: AC 10 ms 5 MB
Back to top page