Skip to main content

Matrix Multiplication

 1. You are given a number n1, representing the number of rows of 1st matrix.

2. You are given a number m1, representing the number of columns of 1st matrix.
3. You are given n1*m1 numbers, representing elements of 2d array a1.
4. You are given a number n2, representing the number of rows of 2nd matrix.
5. You are given a number m2, representing the number of columns of 2nd matrix.
6. You are given n2*m2 numbers, representing elements of 2d array a2.
7. If the two arrays representing two matrices of dimensions n1 * m1 and n2 * m2 can be multiplied, display the contents of prd array as specified in output Format.
8. If the two arrays can't be multiplied, print "Invalid input".
Input Format
A number n1
A number m1
e11
e12..
e21
e22..
.. n1 * m1 number of elements of array a1
A number n2
A number m2
e11'
e12'..
e21'
e22'..
.. n2 * m2 number of elements of array a2
Output Format
e11' e12' e13' ..
e21' e22' e23' ..
.. elements of prd array
Constraints
1 <= n1 <= 10^2
1 <= m1 <= 10^2
-10^9 <= e11, e12, .. n1 * m1 elements <= 10^9
1 <= n2 <= 10^2
1 <= m2 <= 10^2
-10^9 <= e11', e12', .. n2 * m2 elements <= 10^9
Sample Input
2
3
10
0
0
0
20
0
3
4
1
0
1
0
0
1
1
2
1
1
0
0
Sample Output
10 0 10 0
0 20 20 40

import java.io.*;
import java.util.*;

public class Main{

public static void main(String[] args) throws Exception {
    // write your code here
    Scanner sc = new Scanner(System.in);
    int n1 = sc.nextInt();
    int m1 = sc.nextInt();
    int[][] A1 = new int[n1][m1];
    for(int i=0;i<n1;i++)
        for(int j=0;j<m1;j++)
            A1[i][j] = sc.nextInt();
            
    int n2 = sc.nextInt();
    int m2 = sc.nextInt();
    int[][] A2 = new int[n2][m2];
    for(int i=0;i<n2;i++)
        for(int j=0;j<m2;j++)
            A2[i][j] = sc.nextInt();
            
    if(m1 == n2){
        int[][] A = new int[n1][m2];
        
        for(int i=0;i<n1;i++){
            for(int j=0;j<m2;j++){
                int sum = 0;
                for(int k=0;k<m1;k++){
                    sum += A1[i][k]*A2[k][j];
                }
                A[i][j] = sum;
            }    
        }
        
        for(int i=0;i<n1;i++){
            for(int j=0;j<m2;j++)
                System.out.print(A[i][j]+" ");
            System.out.println();
        }
    } 
    else 
        System.out.println("Invalid input");
    
 }

}

Comments

Popular posts from this blog

Display of Provisional Answer Keys and Question Paper with Recorded Responses for Answer Key Challenge | JEE (Main) 2021 Session 4 for Paper 1 (B.E./B.Tech.)

The JEE (Main) - 2021 Session - 4 was conducted throughout the country and abroad on 26, 27, 31 August and 1 September 2021 for Paper 1 (B.E./B.Tech.) in the Computer Based Test (CBT) mode. The National Testing Agency has uploaded the Provisional Answer Keys for Paper 1 (B.E./B.Tech.) along with the Question Paper with Recorded Responses on the website https://jeemain.nta.nic.in for candidates to challenge. The procedure (as enclosed) for the challenge of Answer Key may be used. The candidates, who are not satisfied with the answer key, may challenge the same by paying a fee of ₹ 200/- (Rupees Two Hundred only) per question challenged as a non-refundable processing fee. This facility is available from 06 September 2021 to 08 September 2021 (up to 10:00 A.M.). The payment of the processing fee may be made through, Debit card/Credit Card/Net Banking/Paytm upto 08 September 2021 (upto 11:00 A.M.). No challenge will be entertained without receipt of the processing fee. The Challenges will ...

Print Permutations

 1. You are given a string str. 2. Complete the body of printPermutations function - without changing signature - to calculate and print all permutations of str. Use sample input and output to take idea about permutations. Note -> The online judge can't force you to write the function recursively but that is what the spirit of question is. Write recursive and not iterative logic. The purpose of the question is to aid learning recursion and not test you. Input Format A string str Output Format Permutations of str in order hinted by Sample output Constraints 0 <= str.length <= 7 Sample Input abc Sample Output abc acb bac bca cab cba Solution: import java.io.*; import java.util.*; public class Main {     public static void main(String[] args) throws Exception {         Scanner sc = new Scanner(System.in);         String str = sc.nextLine();         printPermutations(str,"");     }     pu...

JoSAA

JoSAA- JEE counselling Read below to know about JoSAA and related procedures... Q. What is JoSAA? A. J oSAA is an acronym for “Joint Seat Allocation Authority”. It is constituted by the Ministry of HRD to oversee joint seat allocation for the IITs, NITs, IIITs and other GFTIs. It consists of representatives from the Joint Admission Board (JAB) (for IITs) and the Central Seat Allocation Board (CSAB) (for NITs, IIITs (Triple-I-Ts) and Other-GFTIs). JoSAA is the ONLY authorized agency responsible for joint seat allocation, click here to know more... Q. Is there any other agency for conducting the seat allocation to IITs and NITs? A. No agency other than JoSAA is responsible for joint seat allocation for IITs and NIT+ Institutes. Candidates seeking information/assistance from any agency/agent other than JoSAA shall be doing so at their own risk and cost. To read more... Q. What is CSAB? A. CSAB is an acronym for “Central Seat Allocation Board”. It is an agency co...