Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
floyd alfa 1
//g++ 5.4.0 #include <iostream> class Matrix { public: void matrixSize(int a, int b); int getColumn(); int getRow(); void showMatrix(); void fillMatrix(); vector<vector<double>> matrix; vector<vector<char >> matrixA; private: int column; int row; }; void Matrix::matrixSize(int b, int a) { column=a; row=b; matrix.resize(row); for(int i = 0; i < matrix.size(); i++) { matrix[i].resize(column); } } int Matrix::getColumn() { return column; } int Matrix::getRow() { return row; } void Matrix::showMatrix() { int renglonN = 1; cout << " "; for(int a = 1; a <= column; a++) { cout << " " << a << " "; }cout << endl; for(auto i:matrix) { cout << renglonN << " "; for(auto j: i) { printf("%2.3lf ", j); }cout << "\n"; renglonN++; } } void Matrix::fillMatrix() { double in; for(int i = 0; i < row; i++) { for(int j = 0; j < column; j++) { cin >> in; matrix[i][j] = in; } } } Matrix multMatrix(Matrix ma, Matrix mb) { Matrix mr; double suma; int ra = ma.getRow(); int ca = ma.getColumn(); int rb = mb.getRow(); int cb = mb.getColumn(); mr.matrixSize(ra, cb); for(int a = 0; a < ra; a++) { for(int b = 0; b < cb; b++) { suma = 0; for(int i = 0; i < ca; i++) { suma += ma.matrix[a][i]*mb.matrix[i][b]; } mr.matrix[a][b] = suma; } } return mr; } Matrix potMatrix(Matrix a, int pot) { Matrix matrixG; matrixG = a; for(int i = 0; i < pot-1; i++) { matrixG = multMatrix(matrixG, a); } return matrixG; } int main() { }
run
|
edit
|
history
|
help
0
test
cppOverride
CqueueArray
Dar
Get smallest dividers
Synchro#1
Expected types
Test 4(2017)
shared_ptr deleter
count common elements in three sorted array without using extraspace