#include #include typedef struct{ int *elem; int rows; int cols; } matrix; void printm (int *arr, int rows, int cols); int *mValue (int *arr, int rows, int cols); int *mult (int *arr1, int *arr2, int *arr3, int size, int rows, int cols); /* working only for an equal matrixes like [2]*[2] * [2]*[2], unfortunately :( */ int main() { matrix m1; matrix m2; matrix m3; scanf("%d %d %d %d", &m1.rows, &m1.cols, &m2.rows, &m2.cols); if (m1.cols != m2.rows || m1.rows < 1 || m1.cols < 1 || m2.rows < 1 || m2.cols < 1) printf ("Fusk you\n"); else { m1.elem = calloc((m1.rows * m1.cols), sizeof(*m1.elem)); m2.elem = calloc((m2.rows * m2.cols), sizeof(*m2.elem)); m3.elem = calloc((m1.rows * m2.cols), sizeof(*m3.elem)); mValue(m1.elem, m1.rows, m1.cols); mValue(m2.elem, m2.rows, m2.cols); printm(m1.elem, m1.rows, m1.cols); printm(m2.elem, m2.rows, m2.cols); mult(m1.elem, m2.elem, m3.elem, m1.cols, m1.rows, m2.cols); printm(m3.elem, m1.rows, m2.cols); } return 0; } void printm (int *arr, int rows, int cols){ for (int i = 0; i= cols) { */ for (int i = 0; i < rows; i++){ for (int j = 0; j < cols; j++){ scanf("%d", ((arr+i*rows)+j)); } } /* } else { for (int i = 0; i < cols; i++){ for (int j = 0; j < rows; j++){ scanf("%d", ((arr+j)+i*cols)); } } } */ return arr; } int *mult (int *arr1, int *arr2, int *arr3, int size, int rows, int cols){ /* if (rows > cols){ for (int i = 0; i < cols; i++){ for (int j = 0; j < rows; j++){ int dot = 0; for (int k = 0; k < size; k++){ dot += (*((arr1+j*rows)+k)) * (*((arr2+k*rows)+i)); } *((arr3+j)+i*cols)=dot; } } } else { } */ for (int i = 0; i < rows; i++){ for (int j = 0; j < cols; j++){ int dot = 0; for (int k = 0; k < size; k++){ dot += (*((arr1+i*size)+k)) * (*((arr2+k*cols)+j)); } *((arr3+i*rows)+j)=dot; } } return arr3; }

Matrix Multiplication