WAP to add and multiply two matrices of order nxn.
#include<stdio.h> int main() { int i, j, mat1[10][10], mat2[10][10], mat3[10][10]; int row1, col1, row2, col2; printf("\nEnter the number of Rows of Mat1 : "); scanf("%d", &row1); printf("\nEnter the number of Cols of Mat1 : "); scanf("%d", &col1); printf("\nEnter the number of Rows of Mat2 : "); scanf("%d", &row2); printf("\nEnter the number of Columns of Mat2 : "); scanf("%d", &col2); /* Before accepting the Elements Check if no of rows and columns of both matrices is equal */ if (row1 != row2 || col1 != col2) { printf("\nOrder of two matrices is not same "); exit(0); } //Accept the Elements in Matrix 1 for (i = 0; i < row1; i++) { for (j = 0; j < col1; j++) { printf("Enter the Element a[%d][%d] : ", i, j); scanf("%d", &mat1[i][j]); } } //Accept the Elements in Matrix 2 for (i = 0; i < row2; i++) for (j = 0; j < col2; j++) { printf("Enter the Element b[%d][%d] : ", i, j); scanf("%d", &mat2[i][j]); } //Addition of two matrices for (i = 0; i < row1; i++) for (j = 0; j < col1; j++) { mat3[i][j] = mat1[i][j] + mat2[i][j]; } //Print out the Resultant Matrix printf("\nThe Addition of two Matrices is : \n"); for (i = 0; i < row1; i++) { for (j = 0; j < col1; j++) { printf("%d\t", mat3[i][j]); } printf("\n"); } return (0); }
Output
Enter the number of Rows of Mat1 : 3 Enter the number of Columns of Mat1 : 3 Enter the number of Rows of Mat2 : 3 Enter the number of Columns of Mat2 : 3 Enter the Element a[0][0] : 1 Enter the Element a[0][1] : 2 Enter the Element a[0][2] : 3 Enter the Element a[1][0] : 2 Enter the Element a[1][1] : 1 Enter the Element a[1][2] : 1 Enter the Element a[2][0] : 1 Enter the Element a[2][1] : 2 Enter the Element a[2][2] : 1 Enter the Element b[0][0] : 1 Enter the Element b[0][1] : 2 Enter the Element b[0][2] : 3 Enter the Element b[1][0] : 2 Enter the Element b[1][1] : 1 Enter the Element b[1][2] : 1 Enter the Element b[2][0] : 1 Enter the Element b[2][1] : 2 Enter the Element b[2][2] : 1 The Addition of two Matrices is : 2 4 6 4 2 2 2 4 2
No comments:
Post a Comment