不相关循环的0破坏逻辑的二维数组- C++

#include <iostream>
#include <tgmath.h>

using namespace std;

int main() {
  const int m = 2;    //  Number of rows
  const int n = 2;    //  Number of cols

  int totalPoss = 0;  //  Number of unique possibile m X n binary matrices

  //  2^(m * n) = the number of unique binary
  //  combinations of m X n matrices
  int stop = pow(2, m * n);

  //  Error when a = 0, 1 | m = 0 | n = 1
  for (int a = 0; a < stop; a++) {
    int poss[m][n] = {0};       //  2D Array to store each possible matrix
    int nextGen[m][n] = {0};    //  2D Array to store the next generation of cells
    int rem[m * n];             //  1D Array to store the binary entries of the poss[m][n]

    totalPoss = a;
    int hold = a;           //  Stores the current "possibility number" (i.e when
                            //  a = hold = 1 the binary equivilent of 1 will be stored
                            //  in rem[m * n])

    //  Generate binary number based on whatever a is at current iteration
    int c = 0;
    while (hold > 0) {

      // storing remainder in binary array
      rem[c] = hold % 2;
      hold = hold / 2;
      c++;
    }

    cout << "Binary: ";
    for (int i = 0; i < (m * n); i++) {
      cout << rem[i] << " ";
    }

    cout << endl << endl;
  }

  cout << "Total possibilities: " << totalPoss+1 << endl;

  return 0;
}