Skip to main content

C++ = Multiplication of 2 matrices of order m*n by taking input by user.

Code:
#include <iostream>
using namespace std;
int main()
{
int rows1,columns1,rows2,columns2;
cout<<"Enter the rows of first column : ";
cin>>rows1;
    cout<<"Enter the columns of first column : ";
    cin>>columns1;
    
    cout<<"Enter the rows of second column : ";
    cin>>rows2;
    cout<<"Enter the columns of second column : ";
    cin>>columns2;
    int matrix1[rows1][columns1],matrix2[rows2][columns2];
    
    if (rows2==columns1)
    {
    cout<<"Enter the elements of first matrix : ";
    for (int i=0;i<rows1;i++)
    {
    for (int j=0;j<columns1;j++)
    {
    cin>>matrix1[i][j];
}
}
    
    cout<<"Enter the elements of second matrix : ";
    for (int i=0;i<rows2;i++)
    {
    for (int j=0;j<columns2;j++)
    {
    cin>>matrix2[i][j];
}
}
int result[rows1][columns2];
for (int i=0;i<rows1;i++)
{
for (int j=0;j<columns2;j++)
{
result[i][j]={0};
for (int k=0;k<rows2;k++)
{
result[i][j]+=matrix1[i][k]*matrix2[k][j];
}
}
}
cout<<"The resultant matrix is "<<endl;
for (int i=0;i<rows1;i++)
{
for (int j=0;j<columns2;j++)
{
cout<<result[i][j]<<"       ";
}
    cout<<endl;
}
}
}
Result:



Comments

Post a Comment

Popular posts from this blog

C++ = Code to check number is a prime or not. If not find the nearest prime number.

Code:  #include <iostream> using namespace std; bool prime(int n) { if (n<=1) { return false; }        for (int i=2;i<=n/2;i++)    {       if (n%i==0)   {   return false;   }    }         return true; } int nearest(int n) { for (int i=n-1;i>=2;i--) { if (prime(i)) { return i; } } return 0; } int main () { int number; cout<<"Enter any number : "; cin>>number; if (prime(number)) { cout<<"The number is prime. "<<endl; }     else     {     cout<<"The entered number is compositive."<<endl;     cout<<"The nearest prime number will be "<<nearest(number)<<endl; } } Result:
Post a Comment
Read more

C++ = Code to check number wheater it is prime or not.

Code no 1= Without any other function with using another function. #include <iostream> using namespace std; int main() { int number; bool prime=true; cout<<"Enter any number : "; cin>>number; if (number<=1) { prime=false; } else { for (int i=2;i<number;i++) { if (number%i==0) { prime=false; break; } } } if (prime) { cout<<"The number is a prime number."<<endl; } else { cout<<"The number is not a prime number."<<endl; } } Code no: 2= With using another function #include <iostream> #include <cmath> using namespace std; bool prime(int n) { if (n<=1) { return false; } for (int i=2;i<n/2;i++) { if (n%i==0) { return false; } } return true; } int main() { int number; cout<<"Enter any number : "; cin>>number; if (prime(number)) { cout<<"The numbe...
Post a Comment
Read more