This documentation is automatically generated by online-judge-tools/verification-helper
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#include "../../../src/template/template.hpp"
#include "../../../src/matrix/matrix.hpp"
int main() {
Matrix<int> a(2, 3), b(3, 4);
a[0][0] = 1;
a[0][1] = 2;
a[0][2] = 3;
a[1][0] = 4;
a[1][1] = 5;
a[1][2] = 6;
rep(i, 0, 3) rep(j, 0, 4) b[i][j] = i + j;
a *= b;
assert(a.H() == 2);
assert(a.W() == 4);
Matrix<int> c(4, 1, 1);
Matrix<int> d = a * c;
assert(d.H() == 2);
assert(d.W() == 1);
int x, y;
cin >> x >> y;
cout << x + y << '\n';
}#line 1 "verify/unit_test/matrix/matrix.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#line 2 "src/template/template.hpp"
#include <bits/stdc++.h>
#line 4 "src/template/template.hpp"
using namespace std;
using ll = long long;
using P = pair<long long, long long>;
#define rep(i, a, b) for(long long i = (a); i < (b); ++i)
#define rrep(i, a, b) for(long long i = (a); i >= (b); --i)
constexpr long long inf = 4e18;
struct SetupIO {
SetupIO() {
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(30);
}
} setup_io;
#line 3 "src/matrix/matrix.hpp"
template <typename T>
struct Matrix {
Matrix(const int h, const int w, const T& val = 0)
: h(h), w(w), A(h, vector<T>(w, val)) {}
int H() const {
return h;
}
int W() const {
return w;
}
const vector<T>& operator[](const int i) const {
assert(0 <= i and i < h);
return A[i];
}
vector<T>& operator[](const int i) {
assert(0 <= i and i < h);
return A[i];
}
static Matrix I(const int n) {
Matrix mat(n, n);
for(int i = 0; i < n; ++i) mat[i][i] = 1;
return mat;
}
Matrix& operator+=(const Matrix& B) {
assert(h == B.h and w == B.w);
for(int i = 0; i < h; ++i) {
for(int j = 0; j < w; ++j) {
(*this)[i][j] += B[i][j];
}
}
return (*this);
}
Matrix& operator-=(const Matrix& B) {
assert(h == B.h and w == B.w);
for(int i = 0; i < h; ++i) {
for(int j = 0; j < w; ++j) {
(*this)[i][j] -= B[i][j];
}
}
return (*this);
}
Matrix& operator*=(const Matrix& B) {
assert(w == B.h);
vector<vector<T>> C(h, vector<T>(B.w, 0));
for(int i = 0; i < h; ++i) {
for(int k = 0; k < w; ++k) {
for(int j = 0; j < B.w; ++j) {
C[i][j] += (*this)[i][k] * B[k][j];
}
}
}
A.swap(C);
w = B.w;
return (*this);
}
Matrix& pow(long long t) {
assert(h == w);
assert(t >= 0);
Matrix B = Matrix::I(h);
while(t > 0) {
if(t & 1ll) B *= (*this);
(*this) *= (*this);
t >>= 1ll;
}
A.swap(B.A);
return (*this);
}
Matrix operator+(const Matrix& B) const {
return (Matrix(*this) += B);
}
Matrix operator-(const Matrix& B) const {
return (Matrix(*this) -= B);
}
Matrix operator*(const Matrix& B) const {
return (Matrix(*this) *= B);
}
bool operator==(const Matrix& B) const {
assert(h == B.H() and w == B.W());
for(int i = 0; i < h; ++i) {
for(int j = 0; j < w; ++j) {
if(A[i][j] != B[i][j]) return false;
}
}
return true;
}
bool operator!=(const Matrix& B) const {
assert(h == B.H() and w == B.W());
for(int i = 0; i < h; ++i) {
for(int j = 0; j < w; ++j) {
if(A[i][j] != B[i][j]) return true;
}
}
return false;
}
private:
int h, w;
vector<vector<T>> A;
};
#line 4 "verify/unit_test/matrix/matrix.test.cpp"
int main() {
Matrix<int> a(2, 3), b(3, 4);
a[0][0] = 1;
a[0][1] = 2;
a[0][2] = 3;
a[1][0] = 4;
a[1][1] = 5;
a[1][2] = 6;
rep(i, 0, 3) rep(j, 0, 4) b[i][j] = i + j;
a *= b;
assert(a.H() == 2);
assert(a.W() == 4);
Matrix<int> c(4, 1, 1);
Matrix<int> d = a * c;
assert(d.H() == 2);
assert(d.W() == 1);
int x, y;
cin >> x >> y;
cout << x + y << '\n';
}