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

// include----------------------------------------------------------------------------------------------------------------------
#include <bits/stdc++.h>
// using
// namespace--------------------------------------------------------------------------------------------------------------
using namespace std;

// define-----------------------------------------------------------------------------------------------------------------------
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, s, n) for (int i = s; i < (int)n; i++)
#define per(i, n) for (int i = n; i >= 0; i--)
#define ROF(i, s, n) for (int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\\n"
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n)                                                             \\
  for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define CLR(a) memset((a), 0, sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\\n";
#define debug(x)                                                               \\
  cout << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \\
       << " " << __FILE__ << "\\n";
#define sq(n) (n) * (n)

// typedef----------------------------------------------------------------------------------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue<int, vector<int>, greater<int>> minpq;
// const------------------------------------------------------------------------------------------------------------------------
static const double EPS = 1e-10;
static const double PI = acos(-1.0);
static const int mod = 1000000007;
static const int INF = 1 << 25;
static const LL LL_INF = 1152921504606846976;
// global-----------------------------------------------------------------------------------------------------------------------
int n, m, ans = 0;
string ar;
string str;
// #define DEBUG
// int dp[200000000][]
int main() {
  scanf("%d", &n);
  cin >> str;
  ar.resize(n);
  for (int i = 0; i < n; i++) {
    cin >> ar;
    while (ar.size() >= str.size() && str[0] != ar[0]) {
      ar = ar.substr(1, ar.size() - 1);
    }
    while (ar.size() >= str.size() &&
           str[str.size() - 1] != ar[ar.size() - 1]) {
      ar = ar.substr(0, ar.size() - 1);
    }
    if (ar.size() < str.size()) {
      continue;
    }
    for (int j = 0; j < ar.size(); j++) {
      if (ar[j] == str[0]) {
        bool d = false;
        for (int k = j + 1; k < ar.size(); k++) {
          if (ar[k] == str[1]) {
            d = true;
            for (int e = 0; e < str.size(); e++) {
              if (j + e * (k - j) >= ar.size()) {
                d = false;
                break;
              }
              if (ar[j + e * (k - j)] != str[e]) {
                d = false;
                break;
              }
            }
            if (d) {

              break;
            }
          }
        }
        if (d) {
          // debug( ar );
          ans++;
          break;
        }
      }
    }
  }
  printf("%d\\n", ans);
  return 0;
}

Error: -11

Fixed submission:

// include----------------------------------------------------------------------------------------------------------------------
#include <bits/stdc++.h>

// using
// namespace--------------------------------------------------------------------------------------------------------------
using namespace std;

// define-----------------------------------------------------------------------------------------------------------------------
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define FOR(i, s, n) for (int i = s; i < (int)n; i++)
#define per(i, n) for (int i = n; i >= 0; i--)
#define ROF(i, s, n) for (int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\\n"
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define EACH(i, n)                                                             \\
  for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define INF 1 << 25
#define CLR(a) memset((a), 0, sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << "\\n";
#define debug(x)                                                               \\
  cerr << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \\
       << " " << __FILE__ << "\\n";
#define sq(n) (n) * (n)

// typedef----------------------------------------------------------------------------------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue<int, vector<int>, greater<int>> minpq;
// const------------------------------------------------------------------------------------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);

// global-----------------------------------------------------------------------------------------------------------------------
int n, m, k, ans = 0;
VS a;
string str;
#define mod 1000000007
// function--------------------------------------------------------------------------------------------------------------------
int main() {
  scanf("%d", &n);
  cin >> str;
  a.resize(n);
  rep(i, n) {
    cin >> a[i];
    m = a[i].size();
    while (a[i][0] != str[0]) {
      a[i].erase(a[i].begin());
      m--;
    }
    k = str.size();
    while (a[i][m - 1] != str[k - 1]) {
      a[i].erase(a[i].end());
      m--;
    }
  }
  rep(i, n) {
    m = a[i].size();
    if (m < k) {
      continue;
    }
    bool check = false;
    if (a[i].substr(0, k) == str) {
      check = true;
    }
    rep(j, m - k + 1) {
      if (check) {
        break;
      }
      if (a[i][j] == str[0]) {
        if (k == 1) {
          check = true;
          break;
        }
        for (int l = j + 1; j + (l - j) * (k - 1) < m; l++) {
          if (a[i][l] == str[1]) {
            check = true;
            if (k * (j))
              rep(o, k - 1) {
                if (m < j + l + o * (l - j)) {
                  check = false;
                  break;
                }
                if (a[i][l + o * (l - j)] != str[o + 1]) {
                  check = false;
                  break;
                }
              }
          }
        }
      }
    }
    if (check) {
      ans++;
    }
  }
  printf("%d\\n", ans);
  return 0;
}