Skip to main content

C++ = Two 2x2 ordered matrix multiplication

Create a program which contain M and N matrices with the order of 2x2 then assign them any value After that multiply both matrices and print the result matrix on console.

 Code:

#include <iostream>

using namespace std;

int main()

{

    int m[2][2],n[2][2];

    

    cout<<"Assign values to first matrix : "<<endl;

    

    for (int i=0;i<2;i++)

    {

    for (int j=0;j<2;j++)

    {

    cin>>m[i][j];

}

}

cout<<"Assign values to second matrix : "<<endl;

for (int i=0;i<2;i++)

{

for (int j=0;j<2;j++)

{

cin>>n[i][j];

}

}

int l[2][2]={0};

for (int i=0;i<2;i++)

{

for (int j=0;j<2;j++)

{

for (int k=0;k<2;k++)

{

l[i][j] += m[i][k] * n[k][j];

}

}

}

cout<<"The matrix after multiplication is given below : "<<endl;

for (int i=0;i<2;i++)

{

for (int j=0;j<2;j++)

{

cout<<l[i][j]<<"   ";

}

cout<<endl;

}

return 0;

}

Result:



Comments

Post a Comment

Popular posts from this blog

C++ = Code for Counter

Code: #include <iostream> #include <conio.h> using namespace std; int main() {     int count = 0;     char input;     cout << "--------------------------" << endl;     cout << "          Counter         " << endl;     cout << "--------------------------" << endl;     cout << endl;     cout << "Press 1 to counter" << endl;     cout << "Press 0 to quit" << endl;     cout << endl;     cout << "Enter the number continuously : ";     while (true)     {         input = getch();         if (input == '1')         {             count += 1;             cout << "Your counts are " << count << endl;   ...
Post a Comment
Read more

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 for checking any digit palindrome number

Code no: 1 = Using only main function to perform task. #include <iostream> using namespace std; int main() { int number,original,digit,reverse=0; cout<<"Enter any number : "; cin>>number; original=number; while (number!=0) { digit=number%10; reverse=(reverse*10)+digit; number=number/10; } if (original==reverse) { cout<<"This "<<original<<" is Palindrome number."; } else { cout<<"The "<<original<<" is not Palindrome number."; } } Result: Code no: 2 = Using two functions to perform same task. #include <iostream> using namespace std; int isprime(int num) { int digit=0,reverse=0; while (num!=0) { digit=num%10; reverse=(reverse*10)+digit;  num/=10; } return reverse; } int main() { int num; cout<<"Enter any digit to find its sum = "; cin>>num;          int original=num;          if (i...
Post a Comment
Read more