Problem p00947 (C++) — buggy submission, verdict: Runtime Error

#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for (int(i) = (a)-1; (i) >= 0; (i)--)
#define FORR(i, a, b) for (int(i) = (a)-1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template <typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back
template <typename T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;
const double EPS = 1e-9;
FILE *fp;

void init();
void last();

int x[10][10];
void init() {
#ifdef MYLOCAL
  if ((fp = freopen("/Users/sekiya9311/Documents/comp_programming/"
                    "comp_programming/in.txt",
                    "r", stdin)) == NULL) {
    assert(false);
  }
#endif
  for (int i = 0; i < 10; i++) {
    for (int j = 0; j < 10; j++) {
      scanf("%d", &x[i][j]);
    }
  }
  int ans = 0;
  for (int i = 0; i < 10; i++) {
    for (int j = 0; j < 10; j++) {
      for (int k = 0; k < 10; k++) {
        for (int l = 0; l < 10; l++) {
          bool ok = true;
          const int e = x[x[x[x[0][i]][j]][k]][l];
          for (int m = 0; m < 10; m++) {
            if (i != m && x[x[x[x[x[0][m]][j]][k]][l]][e] == 0)
              ok = false;
            if (j != m && x[x[x[x[x[0][i]][m]][k]][l]][e] == 0)
              ok = false;
            if (k != m && x[x[x[x[x[0][i]][j]][m]][l]][e] == 0)
              ok = false;
            if (l != m && x[x[x[x[x[0][i]][j]][k]][m]][e] == 0)
              ok = false;
            if (e != m && x[x[x[x[x[0][i]][j]][k]][l]][m] == 0)
              ok = false;
          }
          vector<int> v{i, j, k, l, e};
          for (int m = 0; m < 4; m++) {
            if (v[m] != v[m + 1]) {
              swap(v[m], v[m + 1]);
              if (x[x[x[x[x[0][v[0]]][v[1]]][v[2]]][v[3]]][v[4]] == 0) {
                ok = false;
              }
              swap(v[m], v[m + 1]);
            }
          }
          ans += !ok;
        }
      }
    }
  }
  printf("%d\\n", ans);
  last();
}

void last() {
#ifdef MYLOCAL
  fclose(fp);
#endif
  exit(0);
}

void solve(int n) { last(); }

signed main(void) {
  LL n, m, p, a, b, c, x, y, z, q;
  string s;
  bool f = false;
  init();
  while (cin >> n, n) {
    solve(n);
    // return 0;
  }
  last();
}

Error: -6
5bba5bf7-04e4-42e8-8377-1c2ac337cc5d.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p00947/C++/s243980370.cpp:75: void init(): Assertion `false' failed.


Fixed submission:

#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for (int(i) = (a)-1; (i) >= 0; (i)--)
#define FORR(i, a, b) for (int(i) = (a)-1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template <typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back
template <typename T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;
const double EPS = 1e-9;
FILE *fp;

void init();
void last();

#define MYLOCAL

int x[10][10];
void init() {
#ifdef MYLOCAL
  if ((fp = freopen("/Users/sekiya9311/Documents/comp_programming/"
                    "comp_programming/in.txt",
                    "r", stdin)) == NULL) {
    assert(false);
  }
#endif
  for (int i = 0; i < 10; i++) {
    for (int j = 0; j < 10; j++) {
      scanf("%d", &x[i][j]);
    }
  }
  int ans = 0;
  for (int i = 0; i < 10; i++) {
    for (int j = 0; j < 10; j++) {
      for (int k = 0; k < 10; k++) {
        for (int l = 0; l < 10; l++) {
          bool ok = true;
          const int e = x[x[x[x[0][i]][j]][k]][l];
          for (int m = 0; m < 10; m++) {
            if (i != m && x[e][x[x[x[x[0][m]][j]][k]][l]] == 0)
              ok = false;
            if (j != m && x[e][x[x[x[x[0][i]][m]][k]][l]] == 0)
              ok = false;
            if (k != m && x[e][x[x[x[x[0][i]][j]][m]][l]] == 0)
              ok = false;
            if (l != m && x[e][x[x[x[x[0][i]][j]][k]][m]] == 0)
              ok = false;
            if (e != m && x[m][x[x[x[x[0][i]][j]][k]][l]] == 0)
              ok = false;
          }
          vector<int> v{i, j, k, l, e};
          for (int m = 0; m < 4; m++) {
            if (v[m] != v[m + 1]) {
              swap(v[m], v[m + 1]);
              if (x[x[x[x[x[0][v[0]]][v[1]]][v[2]]][v[3]]][v[4]] == 0) {
                ok = false;
              }
            }
          }
          ans += !ok;
        }
      }
    }
  }
  printf("%d\\n", ans);
  last();
}

void last() {
#ifdef MYLOCAL
  fclose(fp);
#endif
  exit(0);
}

void solve(int n) { last(); }

signed main(void) {
  LL n, m, p, a, b, c, x, y, z, q;
  string s;
  bool f = false;
  init();
  while (cin >> n, n) {
    solve(n);
    // return 0;
  }
  last();
}