Skip to content
Related Articles

Related Articles

Improve Article

Replace every matrix element with maximum of GCD of row or column

  • Difficulty Level : Easy
  • Last Updated : 21 May, 2021

Given a matrix of n rows and m columns. The task is to replace each matrix element with Greatest Common Divisor of its row or column, whichever is maximum. That is, for each element (i, j) replace it from GCD of i’th row or GCD of j’th row, whichever is greater.
Examples : 
 

Input : mat[3][4] = {1, 2, 3, 3,
                     4, 5, 6, 6
                     7, 8, 9, 9}  
Output :  1 1 3 3
          1 1 3 3
          1 1 3 3
For index (0,2), GCD of row 0 is 1, GCD of row 2 is 3.
So replace index (0,2) with 3 (3>1).

 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

The idea is to us concept discussed here LCM of an array to find the GCD of row and column.
Using the brute force, we can traverse element of matrix, find the GCD of row and column corresponding to the element and replace it with maximum of both.
An Efficient method is to make two arrays of size n and m for row and column respectively. And store the GCD of each row and each column. An Array of size n will contain GCD of each row and array of size m will contain the GCD of each column. And replace each element with maximum of its corresponding row GCD or column GCD.
Below is the implementation of this approach: 
 

C++




// C++ program to replace each each element with
// maximum of GCD of row or column.
#include<bits/stdc++.h>
using namespace std;
#define R 3
#define C 4
 
// returning the greatest common divisor of two number
int gcd(int a, int b)
{
    if (b == 0)
        return a;
    return gcd(b, a%b);
}
 
// Finding GCD of each row and column and replacing
// with each element with maximum of GCD of row or
// column.
void replacematrix(int mat[R][C], int n, int m)
{
    int rgcd[R] = { 0 }, cgcd[C] = { 0 };
 
    // Calculating GCD of each row and each column in
    // O(mn) and store in arrays.
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            rgcd[i] = gcd(rgcd[i], mat[i][j]);
            cgcd[j] = gcd(cgcd[j], mat[i][j]);
        }
    }
 
    // Replacing matrix element
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            mat[i][j] = max(rgcd[i], cgcd[j]);
}
 
// Driven Program
int main()
{
    int m[R][C] =
    {
        1, 2, 3, 3,
        4, 5, 6, 6,
        7, 8, 9, 9,
    };
 
    replacematrix(m, R, C);
 
    for (int i = 0; i < R; i++)
    {
        for (int j = 0; j < C; j++)
            cout << m[i][j] << " ";
        cout<<endl;
    }
 
    return 0;
}
Java



// Java program to replace each each element with
// maximum of GCD of row or column.
import java .io.*;
 
class GFG
{
      static int R = 3;
      static int C = 4;
 
      // returning the greatest common
      // divisor of two number
      static int gcd(int a, int b)
      {
         if (b == 0)
         return a;
         return gcd(b, a%b);
      }
 
// Finding GCD of each row and column and
// replacing with each element with maximum
// of GCD of row or column.
static void replacematrix(int [][]mat, int n, int m)
{
    int []rgcd = new int[R] ;
    int []cgcd = new int[C];
 
    // Calculating GCD of each row and each column in
    // O(mn) and store in arrays.
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            rgcd[i] = gcd(rgcd[i], mat[i][j]);
            cgcd[j] = gcd(cgcd[j], mat[i][j]);
        }
    }
 
    // Replacing matrix element
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            mat[i][j] = Math.max(rgcd[i], cgcd[j]);
}
 
// Driver program
    static public void main (String[] args){
    int [][]m =
    {
        {1, 2, 3, 3},
        {4, 5, 6, 6},
        {7, 8, 9, 9},
    };
 
    replacematrix(m, R, C);
 
    for (int i = 0; i < R; i++)
    {
        for (int j = 0; j < C; j++)
        System.out.print(m[i][j] + " ");
        System.out.println();
    }
    }
}
 
//This code is contributed by vt_m.
Python3



# Python3 program to replace each each element
# with maximum of GCD of row or column.
 
R = 3
C = 4
 
# returning the greatest common
# divisor of two number
def gcd(a, b):
    if (b == 0):
        return a
    return gcd(b, a % b)
 
# Finding GCD of each row and column
# and replacing with each element with
# maximum of GCD of row or column.
def replacematrix(mat, n, m):
 
    rgcd = [0] * R
    cgcd = [0] * C
 
    # Calculating GCD of each row and each
    # column in O(mn) and store in arrays.
    for i in range (n):
        for j in range (m):
         
            rgcd[i] = gcd(rgcd[i], mat[i][j])
            cgcd[j] = gcd(cgcd[j], mat[i][j])
 
    # Replacing matrix element
    for i in range (n):
        for j in range (m):
            mat[i][j] = max(rgcd[i], cgcd[j])
 
# Driver Code
if __name__ == "__main__":
 
    m = [[1, 2, 3, 3],
         [4, 5, 6, 6],
         [7, 8, 9, 9]]
 
    replacematrix(m, R, C)
 
    for i in range(R):
        for j in range (C):
            print ( m[i][j], end = " ")
        print ()
     
# This code is contributed by ita_c
C#



// C# program to replace each each element with
// maximum of GCD of row or column.
using System;
 
class GFG
{
      static int R = 3;
      static int C = 4;
   
      // returning the greatest common
      // divisor of two number
      static int gcd(int a, int b)
      {
        if (b == 0)
        return a;
        return gcd(b, a%b);
      }
 
// Finding GCD of each row and column and
// replacing with each element with maximum
// of GCD of row or column.
static void replacematrix(int [,]mat, int n, int m)
{
    int []rgcd = new int[R] ;
    int []cgcd = new int[C];
 
    // Calculating GCD of each row and each column in
    // O(mn) and store in arrays.
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            rgcd[i] = gcd(rgcd[i], mat[i,j]);
            cgcd[j] = gcd(cgcd[j], mat[i,j]);
        }
    }
 
    // Replacing matrix element
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            mat[i,j] = Math.Max(rgcd[i], cgcd[j]);
}
 
// Driver program
    static public void Main (){
    int [,]m =
    {
        {1, 2, 3, 3},
        {4, 5, 6, 6},
        {7, 8, 9, 9},
    };
 
    replacematrix(m, R, C);
 
    for (int i = 0; i < R; i++)
    {
        for (int j = 0; j < C; j++)
        Console.Write(m[i,j] + " ");
        Console.WriteLine();
    }
    }
}
 
//This code is contributed by vt_m.
Javascript



<script>
    // Javascript program to replace each each element with
    // maximum of GCD of row or column.
     
    let R = 3;
    let C = 4;
 
    // returning the greatest common
    // divisor of two number
    function gcd(a, b)
    {
      if (b == 0)
        return a;
      return gcd(b, a%b);
    }
     
    // Finding GCD of each row and column and
    // replacing with each element with maximum
    // of GCD of row or column.
    function replacematrix(mat, n, m)
    {
        let rgcd = new Array(R);
        rgcd.fill(0);
        let cgcd = new Array(C);
        cgcd.fill(0);
 
        // Calculating GCD of each row and each column in
        // O(mn) and store in arrays.
        for (let i = 0; i < n; i++)
        {
            for (let j = 0; j < m; j++)
            {
                rgcd[i] = gcd(rgcd[i], mat[i][j]);
                cgcd[j] = gcd(cgcd[j], mat[i][j]);
            }
        }
 
        // Replacing matrix element
        for (let i = 0; i < n; i++)
            for (let j = 0; j < m; j++)
                mat[i][j] = Math.max(rgcd[i], cgcd[j]);
    }
     
    let m = [ [1, 2, 3, 3],
              [4, 5, 6, 6],
              [7, 8, 9, 9] ];
   
    replacematrix(m, R, C);
   
    for (let i = 0; i < R; i++)
    {
        for (let j = 0; j < C; j++)
            document.write(m[i][j] + " ");
          document.write("</br>");
    }
 
</script>
Output: 
 
1 1 3 3 
1 1 3 3 
1 1 3 3 
Time Complexity : O(mn). 
Axillary Space : O(m + n).
This article is contributed by Anuj Chauahan(anuj0503). If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
 



My Personal Notes
arrow_drop_up
Previous
GCD, LCM and Distributive Property
Next

GCD of two numbers formed by n repeating x and y times
Recommended Articles
Page :
Check if it is possible to create a matrix such that every row has A 1s and every column has B 1s
15, Aug 20
Construct a matrix such that union of ith row and ith column contains every element from 1 to 2N-1
18, Mar 20
Generate a Matrix such that given Matrix elements are equal to Bitwise OR of all corresponding row and column elements of generated Matrix
15, Jan 21
Filling diagonal to make the sum of every row, column and diagonal equal of 3x3 matrix
27, Jan 19
Find a Square Matrix such that sum of elements in every row and column is K
09, Sep 19
Minimum row or column swaps required to make every pair of adjacent cell of a Binary Matrix distinct
07, Jan 21
Find trace of matrix formed by adding Row-major and Column-major order of same matrix
04, Dec 17
Check if a given matrix can be converted to another given matrix by row and column exchanges
30, Apr 20
Sum of matrix in which each element is absolute difference of its row and column numbers
06, Feb 17
Sum of matrix element where each elements is integer division of row and column
20, Feb 17
Minimum element of each row and each column in a matrix
28, Nov 18
Find the original matrix when largest element in a row and a column are given
18, Apr 19
Check whether row or column swaps produce maximum size binary sub-matrix with all 1s
03, Feb 17
Maximum sum of a Matrix where each value is from a unique row and column
08, Apr 20
Find all matrix elements which are minimum in their row and maximum in their column
23, Sep 20
Maximum sum of any submatrix of a Matrix which is sorted row-wise and column-wise
10, Aug 20
Find an N x N grid whose xor of every row and column is equal
03, Sep 19
Count number of islands where every island is row-wise and column-wise separated
27, Feb 15
Search in a row wise and column wise sorted matrix
10, Mar 11
Print all elements in sorted order from row and column wise sorted matrix
22, Oct 14
Count zeros in a row wise and column wise sorted matrix
20, Jul 16
Check if sums of i-th row and i-th column are same in matrix
10, Sep 17
heapq in Python to print all elements in sorted order from row and column wise sorted matrix
07, Nov 17
Minimum operations required to make each row and column of matrix equals
25, Dec 17
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox