Java Program for Counting sets of 1s and 0s in a binary matrix

// Java program to compute number of sets
// in a binary matrix.
class GFG {
static final int m = 3; // no of columns
static final int n = 2; // no of rows

// function to calculate the number of
// non empty sets of cell
static long countSets(int a[][]) {

    // stores the final answer
    long res = 0;

    // traverses row-wise
    for (int i = 0; i < n; i++) {
    int u = 0, v = 0;
    for (int j = 0; j < m; j++) {
        if (a[i][j] == 1)
        u++;
        else
        v++;
    }
    res += Math.pow(2, u) - 1 + Math.pow(2, v) - 1;
    }

    // traverses column wise
    for (int i = 0; i < m; i++) {
    int u = 0, v = 0;
    for (int j = 0; j < n; j++) {
        if (a[j][i] == 1)
        u++;
        else
        v++;
    }
    res += Math.pow(2, u) - 1 + Math.pow(2, v) - 1;
    }

    // at the end subtract n*m as no of
    // single sets have been added twice.
    return res - (n * m);
}

// Driver code
public static void main(String[] args) {
    int a[][] = {{1, 0, 1}, {0, 1, 0}};

    System.out.print(countSets(a));
}
}
// This code is contributed by Anant Agarwal.