Given a number N denotes the total number of elements in a matrix, the task is to print all possible order of matrix. An order is a pair (m, n) of integers where m is number of rows and n is number of columns. For example, if the number of elements is 8 then all possible orders are:
(1, 8), (2, 4), (4, 2), (8, 1).
Input: N = 8
Output: (1, 2) (2, 4) (4, 2) (8, 1)
Input: N = 100
(1, 100) (2, 50) (4, 25) (5, 20) (10, 10) (20, 5) (25, 4) (50, 2) (100, 1)
A matrix is said to be of order m x n if it has m rows and n columns. The total number of elements in a matrix is equal to (m*n). So we start from 1 and check one by one if it divides N(the total number of elements). If it divides, it will be one possible order.
Below is the implementation of the above approach:
1 10 2 5 5 2 10 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.
- Different Operations on Matrices
- Count pairs from two sorted matrices with given sum
- Queries on number of Binary sub-matrices of Given size
- Minimum elements to be added so that two matrices can be multiplied
- Count sub-matrices having sum divisible 'k'
- Program to check if two given matrices are identical
- Python List Equality | Program to check if two given matrices are identical
- Program to concatenate two given Matrices of same size
- Check if the given two matrices are mirror images of one another
- Number of square matrices with all 1s
- Program to multiply two matrices
- Program for addition of two matrices
- Program for subtraction of matrices
- Multiplication of two Matrices in Single line using Numpy in Python
- Python program to add two Matrices
- Python program to multiply two matrices
- Kronecker Product of two matrices
- A square matrix as sum of symmetric and skew-symmetric matrices
- Find the intersection of two Matrices
- XOR of XORs of all sub-matrices
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.