Count of odd sum Submatrix with odd element count in the Matrix
Last Updated :
11 Nov, 2023
Given a matrix mat[][] of size N x N, the task is to count the number of submatrices with the following properties:
- The sum of all elements in the submatrix is odd.
- The number of elements in the submatrix is odd.
Examples:
Input: mat[][] = {{1, 2, 3}, {7, 5, 9}, {6, 8, 10}}
Output: 8
Explanation: As here total 8 submatrix is available in given matrix in which no. of elements is odd and sum of elements is also odd list of that matrix are {{1}}, {{3}}, {{7}}, {{5}}, {{9}}, {{7, 5, 9}}, {{2}, {5}, {8}}, {{1, 2, 3}, {7, 5, 9}, {5, 9, 6}}
Input: mat[][] = {{15, 2, 31}, {17, 11, 12}, {16, 51, 10}, {13, 52, 18}}
Output: 14
Naive Approach: We can solve this problem using a brute force approach, where we consider all possible submatrices of the given matrix and check if they satisfy the given properties.
Below is the code for the above approach:
C++
// C++ code for the above approach:
#include <bits/stdc++.h>
using namespace std;
int oddSumOddElementCountSubmatrix(
vector<vector<int> >& mat)
{
// Size of given 2-D matrix
int n = mat.size();
int count = 0;
// Here we need all submatrix which
// contains odd no. of element in them.
// So all the matrix whose size is in
// form 1*3, 1*5, 1*7, 3*1, 3*3, 3*5,
// 3*7, 5*1, ... are valid submatrix
// now we need to check for that sum
// of element present in that
// submatrix is odd or not
// So this nested 4 for loop generates
// all submatrix with size as
// mentioned above
for (int rsize = 1; rsize <= n; rsize += 2) {
for (int csize = 1; csize <= n; csize += 2) {
for (int row = 0; row + rsize <= n; row++) {
for (int col = 0; col + csize <= n; col++) {
// Now do summation of
// element present in
// that subarray and if
// it's odd increment
// the count
int sum = 0;
for (int i = row; i < row + rsize;
i++) {
for (int j = col; j < col + csize;
j++) {
sum += mat[i][j];
}
}
if (sum % 2 == 1) {
count++;
}
}
}
}
}
// Return answer
return count;
}
// Drivers code
int main()
{
vector<vector<int> > mat
= { { 1, 2, 3 }, { 7, 5, 9 }, { 6, 8, 10 } };
// Function Call
cout << "Number of odd sum submatrices with odd number "
"of elements: "
<< oddSumOddElementCountSubmatrix(mat) << "\n";
return 0;
}
import java.util.*;
public class Main {
public static int oddSumOddElementCountSubmatrix(int[][] mat) {
// Size of given 2-D matrix
int n = mat.length;
int count = 0;
// Here we need all submatrix which
// contains odd no. of element in them.
// So all the matrix whose size is in
// form 1*3, 1*5, 1*7, 3*1, 3*3, 3*5,
// 3*7, 5*1, ... are valid submatrix
// now we need to check for that sum
// of element present in that
// submatrix is odd or not
// So this nested 4 for loop generates
// all submatrix with size as
// mentioned above
for (int rsize = 1; rsize <= n; rsize += 2) {
for (int csize = 1; csize <= n; csize += 2) {
for (int row = 0; row + rsize <= n; row++) {
for (int col = 0; col + csize <= n; col++) {
// Now do summation of
// element present in
// that subarray and if
// it's odd increment
// the count
int sum = 0;
for (int i = row; i < row + rsize; i++) {
for (int j = col; j < col + csize; j++) {
sum += mat[i][j];
}
}
if (sum % 2 == 1) {
count++;
}
}
}
}
}
// Return answer
return count;
}
// Drivers code
public static void main(String[] args) {
int[][] mat = { { 1, 2, 3 }, { 7, 5, 9 }, { 6, 8, 10 } };
// Function Call
System.out.println("Number of odd sum submatrices with odd number of elements: " + oddSumOddElementCountSubmatrix(mat));
}
}
//This code is contributed by tushar rokade
def oddSumOddElementCountSubmatrix(mat):
# Size of given 2-D matrix
n = len(mat)
count = 0
# Here we need all submatrix which
# contains odd no. of element in them.
# So all the matrix whose size is in
# form 1*3, 1*5, 1*7, 3*1, 3*3, 3*5,
# 3*7, 5*1, ... are valid submatrix
# now we need to check for that sum
# of element present in that
# submatrix is odd or not
# So this nested 4 for loop generates
# all submatrix with size as
# mentioned above
for rsize in range(1, n+1, 2):
for csize in range(1, n+1, 2):
for row in range(n-rsize+1):
for col in range(n-csize+1):
# Now do summation of
# element present in
# that subarray and if
# it's odd increment
# the count
subMatSum = 0
for i in range(row, row+rsize):
for j in range(col, col+csize):
subMatSum += mat[i][j]
if subMatSum % 2 == 1:
count += 1
# Return answer
return count
# Driver code
mat = [[1, 2, 3], [7, 5, 9], [6, 8, 10]]
print("Number of odd sum submatrices with odd number of elements: ", oddSumOddElementCountSubmatrix(mat))
// C# code for above approach
using System;
public class GFG {
public static int oddSumOddElementCountSubmatrix(int[][] mat) {
// Size of given 2-D matrix
int n = mat.Length;
int count = 0;
// Here we need all submatrix which
// contains odd no. of element in them.
// So all the matrix whose size is in
// form 1*3, 1*5, 1*7, 3*1, 3*3, 3*5,
// 3*7, 5*1, ... are valid submatrix
// now we need to check for that sum
// of element present in that
// submatrix is odd or not
// So this nested 4 for loop generates
// all submatrix with size as
// mentioned above
for (int rsize = 1; rsize <= n; rsize += 2) {
for (int csize = 1; csize <= n; csize += 2) {
for (int row = 0; row + rsize <= n; row++) {
for (int col = 0; col + csize <= n; col++) {
// Now do summation of
// element present in
// that subarray and if
// it's odd increment
// the count
int sum = 0;
for (int i = row; i < row + rsize; i++) {
for (int j = col; j < col + csize; j++) {
sum += mat[i][j];
}
}
if (sum % 2 == 1) {
count++;
}
}
}
}
}
// Return answer
return count;
}
// Drivers code
public static void Main() {
int[][] mat = new int[][] { new int[] { 1, 2, 3 },
new int[] { 7, 5, 9 },
new int[] { 6, 8, 10 } };
// Function Call
Console.WriteLine("Number of odd sum submatrices with odd number of elements: " +
oddSumOddElementCountSubmatrix(mat));
}
}
// This code is contributed by Vaibhav Nandan
function oddSumOddElementCountSubmatrix(mat) {
// Size of given 2-D matrix
let n = mat.length;
let count = 0;
// Here we need all submatrix which
// contains odd no. of element in them.
// So all the matrix whose size is in
// form 1*3, 1*5, 1*7, 3*1, 3*3, 3*5,
// 3*7, 5*1, ... are valid submatrix
// now we need to check for that sum
// of element present in that
// submatrix is odd or not
// So this nested 4 for loop generates
// all submatrix with size as
// mentioned above
for (let rsize = 1; rsize <= n; rsize += 2) {
for (let csize = 1; csize <= n; csize += 2) {
for (let row = 0; row + rsize <= n; row++) {
for (let col = 0; col + csize <= n; col++) {
// Now do summation of
// element present in
// that subarray and if
// it's odd increment
// the count
let sum = 0;
for (let i = row; i < row + rsize; i++) {
for (let j = col; j < col + csize; j++) {
sum += mat[i][j];
}
}
if (sum % 2 === 1) {
count++;
}
}
}
}
}
// Return answer
return count;
}
// Test case
let mat = [[1, 2, 3], [7, 5, 9], [6, 8, 10]];
console.log("Number of odd sum submatrices with odd number of elements: " + oddSumOddElementCountSubmatrix(mat));
OutputNumber of odd sum submatrices with odd number of elements: 8
Time Complexity: O(N6), as 6 nested for loop requires to make matrix as required
Auxiliary Space: O(1), no extra space used.
Efficient Approach: To solve the problem follow the below idea:
- To optimize the solution, we can use a technique called prefix sums. We can precompute the sum of all elements in the matrix up to a particular row and column and store it in a separate matrix. This precomputation will allow us to calculate the sum of any submatrix in constant time.
- Once we have precomputed the prefix sums, we can iterate over all possible submatrices and check if they satisfy the above properties. To check if the sum of elements in a submatrix is odd, we can subtract the prefix sum of the bottom-right corner from the prefix sum of the top-left corner. If the difference is odd, the sum of the submatrix is odd.
- To check if the number of elements in a submatrix is odd, we can count the number of rows and columns in the submatrix and check if their product is odd.
Below are the steps for the above approach:
- Initialize a prefix sum matrix with 0, of the same size as the given matrix.
- Precompute the prefix sums of all elements up to each row and column in the prefix sum matrix.
- prefixSum[i][j] = prefixSum[i - 1][j] + prefixSum[i][j - 1] - prefixSum[i - 1][j - 1] + matrix[i - 1][j - 1].
- Iterate over all possible submatrices in the given matrix.
- For each submatrix, calculate the sum of its elements using the prefix sum matrix.
- If the sum is odd, count the number of elements in the submatrix.
- If the number of elements is odd, increment the counter.
- Return the final count.
Below is the code for the above approach:
C++
// C++ code for the above approach:
#include <bits/stdc++.h>
using namespace std;
int countOddSumSubmatrices(vector<vector<int> >& matrix)
{
int n = matrix.size();
int m = matrix[0].size();
int count = 0;
// Initialize prefix sum matrix
vector<vector<int> > prefixSum(n + 1,
vector<int>(m + 1, 0));
// Precompute prefix sums
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
prefixSum[i][j] = prefixSum[i - 1][j]
+ prefixSum[i][j - 1]
- prefixSum[i - 1][j - 1]
+ matrix[i - 1][j - 1];
}
}
// Iterate over all submatrices
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
for (int k = i; k <= n; k++) {
for (int l = j; l <= m; l++) {
// Calculate sum of
// submatrix
int sum = prefixSum[k][l]
- prefixSum[i - 1][l]
- prefixSum[k][j - 1]
+ prefixSum[i - 1][j - 1];
// Check if sum is odd
// and number of
// elements is odd
if (sum % 2 == 1
&& ((k - i + 1) * (l - j + 1)) % 2
== 1) {
count++;
}
}
}
}
}
return count;
}
// Drivers code
int main()
{
vector<vector<int> > matrix
= { { 1, 2, 3 }, { 7, 5, 9 }, { 6, 8, 10 } };
int count = countOddSumSubmatrices(matrix);
// Function Call
cout << "Number of odd sum submatrices with odd number "
"of elements: "
<< count << endl;
return 0;
}
import java.util.*;
public class Main {
public static int countOddSumSubmatrices(int[][] matrix) {
int n = matrix.length;
int m = matrix[0].length;
int count = 0;
// Initialize prefix sum matrix
int[][] prefixSum = new int[n + 1][m + 1];
// Precompute prefix sums
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
prefixSum[i][j] = prefixSum[i - 1][j]
+ prefixSum[i][j - 1]
- prefixSum[i - 1][j - 1]
+ matrix[i - 1][j - 1];
}
}
// Iterate over all submatrices
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
for (int k = i; k <= n; k++) {
for (int l = j; l <= m; l++) {
// Calculate sum of submatrix
int sum = prefixSum[k][l]
- prefixSum[i - 1][l]
- prefixSum[k][j - 1]
+ prefixSum[i - 1][j - 1];
// Check if sum is odd and the number of elements is odd
if (sum % 2 == 1
&& ((k - i + 1) * (l - j + 1)) % 2 == 1) {
count++;
}
}
}
}
}
return count;
}
public static void main(String[] args) {
int[][] matrix = {{1, 2, 3}, {7, 5, 9}, {6, 8, 10}};
int count = countOddSumSubmatrices(matrix);
// Function Call
System.out.println("Number of odd sum submatrices with an odd number of elements: " + count);
}
}
def count_odd_sum_submatrices(matrix):
n = len(matrix)
m = len(matrix[0])
count = 0
# Initialize the prefix sum matrix
prefix_sum = [[0] * (m + 1) for _ in range(n + 1)]
# Precompute prefix sums
for i in range(1, n + 1):
for j in range(1, m + 1):
prefix_sum[i][j] = prefix_sum[i - 1][j] + prefix_sum[i][j - 1] - prefix_sum[i - 1][j - 1] + matrix[i - 1][j - 1]
# Iterate over all submatrices
for i in range(1, n + 1):
for j in range(1, m + 1):
for k in range(i, n + 1):
for l in range(j, m + 1):
# Calculate the sum of the submatrix
submatrix_sum = prefix_sum[k][l] - prefix_sum[i - 1][l] - prefix_sum[k][j - 1] + prefix_sum[i - 1][j - 1]
# Check if the sum is odd and the number of elements is odd
if submatrix_sum % 2 == 1 and ((k - i + 1) * (l - j + 1)) % 2 == 1:
count += 1
return count
# Driver's code
if __name__ == "__main__":
matrix = [
[1, 2, 3],
[7, 5, 9],
[6, 8, 10]
]
count = count_odd_sum_submatrices(matrix)
# Function Call
print(f"Number of odd sum submatrices with an odd number of elements: {count}")
using System;
class GFG
{
static int countOddSumSubmatrices(int[][] matrix)
{
int n = matrix.Length;
int m = matrix[0].Length;
int count = 0;
// Initialize prefix sum matrix
int[][] prefixSum = new int[n + 1][];
for (int i = 0; i <= n; i++)
{
prefixSum[i] = new int[m + 1];
}
// Precompute prefix sums
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
prefixSum[i][j] = prefixSum[i - 1][j]
+ prefixSum[i][j - 1]
- prefixSum[i - 1][j - 1]
+ matrix[i - 1][j - 1];
}
}
// Iterate over all submatrices
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
for (int k = i; k <= n; k++)
{
for (int l = j; l <= m; l++)
{
// Calculate sum of submatrix
int sum = prefixSum[k][l]
- prefixSum[i - 1][l]
- prefixSum[k][j - 1]
+ prefixSum[i - 1][j - 1];
// Check if sum is odd and number of elements is odd
if (sum % 2 == 1
&& ((k - i + 1) * (l - j + 1)) % 2 == 1)
{
count++;
}
}
}
}
}
return count;
}
public static void Main()
{
int[][] matrix = {
new int[] { 1, 2, 3 },
new int[] { 7, 5, 9 },
new int[] { 6, 8, 10 }
};
int count = countOddSumSubmatrices(matrix);
// Function Call
Console.WriteLine("Number of odd sum submatrices with odd number of elements: " + count);
}
}
function countOddSumSubmatrices(matrix) {
const n = matrix.length;
const m = matrix[0].length;
let count = 0;
// Initialize prefix sum matrix
const prefixSum = new Array(n + 1).fill(0).map(() => new Array(m + 1).fill(0));
// Precompute prefix sums
for (let i = 1; i <= n; i++) {
for (let j = 1; j <= m; j++) {
prefixSum[i][j] = prefixSum[i - 1][j] + prefixSum[i][j - 1] - prefixSum[i - 1][j - 1] + matrix[i - 1][j - 1];
}
}
// Iterate over all submatrices
for (let i = 1; i <= n; i++) {
for (let j = 1; j <= m; j++) {
for (let k = i; k <= n; k++) {
for (let l = j; l <= m; l++) {
// Calculate sum of submatrix
const sum = prefixSum[k][l] - prefixSum[i - 1][l] - prefixSum[k][j - 1] + prefixSum[i - 1][j - 1];
// Check if sum is odd and the number of elements is odd
if (sum % 2 === 1 && ((k - i + 1) * (l - j + 1)) % 2 === 1) {
count++;
}
}
}
}
}
return count;
}
// Driver code
const matrix = [
[1, 2, 3],
[7, 5, 9],
[6, 8, 10]
];
const count = countOddSumSubmatrices(matrix);
// Function call
console.log("Number of odd sum submatrices with odd number of elements: " + count);
OutputNumber of odd sum submatrices with odd number of elements: 8
Time Complexity: O(N4), as 4 nested for loop
Auxiliary Space: O(N2), extra space needed for prefix matrix.
Similar Reads
Count of submatrix with sum X in a given Matrix
Given a matrix of size N x M and an integer X, the task is to find the number of sub-squares in the matrix with sum of elements equal to X.Examples: Input: N = 4, M = 5, X = 10, arr[][]={{2, 4, 3, 2, 10}, {3, 1, 1, 1, 5}, {1, 1, 2, 1, 4}, {2, 1, 1, 1, 3}} Output: 3 Explanation: {10}, {{2, 4}, {3, 1}
15+ min read
Count rows in a matrix that consist of same element
Given a matrix mat[][], the task is to count the number of rows in the matrix that consists of the same elements. Examples: Input: mat[][] = {{1, 1, 1}, {1, 2, 3}, {5, 5, 5}} Output: 2 All the elements of the first row and all the elements of the third row are the same. Input: mat[][] = {{1, 2}, {4,
9 min read
Count rows with sum exceeding sum of the remaining Matrix
Given a matrix mat[][] of dimensions N * M, the task is to count the number of rows whose sum exceeds the sum of the remaining elements of the Matrix. Examples: Input: mat[][] = {{1, 5}, {2, 3}}Output: 1Explanation: Sum of elements of the first row {1, 5} exceeds the sum of the remaining matrix {2,
7 min read
Construct a matrix with sum equal to the sum of diagonal elements
Given an integer N, the task is to construct a matrix of size N2 using positive and negative integers and excluding 0, such that the sum of the matrix is equal to the sum of the diagonal of the matrix. Examples: Input: N = 2 Output: 1 -2 2 4 Explanation: Diagonal sum = (1 + 4) = 5 Matrix sum = (1 -
4 min read
Construct a square matrix such that the sum of each row and column is odd
Given an integer N. Then your task is to output a square matrix of length N using the numbers from the range [1, N2] such that the sum of each row and column is odd. Note: If there are multiple solution, then print any of them. Examples: Input: N = 2 Output: {{1, 2}, {4, 3}} Explanation: Let us calc
12 min read
Sum of Matrix where each element is sum of row and column number
Given two numbers M and N denoting the number of rows and columns of a matrix A[] where A[i][j] is the sum of i and j (indices follow 1 based indexing), the task is to find the sum of elements of the matrix. Examples: Input: M = 3, N = 3Output: 36Explanation: A[]: {{2, 3, 4}, {3, 4, 5}, {4, 5, 6}}.
14 min read
Count subarrays with same even and odd elements
Given an array of N integers, count number of even-odd subarrays. An even - odd subarray is a subarray that contains the same number of even as well as odd integers. Examples : Input : arr[] = {2, 5, 7, 8} Output : 3 Explanation : There are total 3 even-odd subarrays. 1) {2, 5} 2) {7, 8} 3) {2, 5, 7
15+ min read
Count elements smaller than or equal to x in a sorted matrix
Given a n x n strictly sorted matrix and a value x. The problem is to count the elements smaller than or equal to x in the given matrix. Here strictly sorted matrix means that matrix is sorted in a way such that all elements in a row are sorted in increasing order and for row ‘i’, where 1 <= i
14 min read
Count of substrings with the frequency of at most one character as Odd
Given a string S of N characters, the task is to calculate the total number of non-empty substrings such that at most one character occurs an odd number of times. Example: Input: S = "aba"Output: 4Explanation: The valid substrings are "a", "b", "a", and "aba". Therefore, the total number of required
7 min read
Count of matrices (of different orders) with given number of elements
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),
5 min read