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

// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

// conversion
//------------------------------------------
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T> inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}

// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }

// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c)                                                             \\
  for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())

// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)

// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);

// clear memory
#define CLR(a) memset((a), 0, sizeof(a))

// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x)                                                               \\
  cerr << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \\
       << " " << __FILE__ << endl;

int gcd(int a, int b) {
  int tmp;
  while (a % b == 0) {
    tmp = a % b;
    a = b;
    b = tmp;
  }
}

int lcm(int a, int b) { return a * b / gcd(a, b); }

bool prime_number(int n) {
  vector<bool> i;
  if (n < 2) {
    return false;
  } else if (n == 2) {
    return true;
  }
  if (n % 2 == 0) {
    return false;
  }
  for (int i = 3; i <= n / i; i += 2) {
    if (n % i == 0)
      return false;
    return true;
  }
}

int main() {
  string s;

  getline(cin, s);
  if (s.size() > 7)
    REP(i, s.size() - 7) {
      // cout << count(s.begin()+i,s.begin()+i+7,'Y')<< endl;
      if (2 == count(s.begin() + i, s.begin() + i + 8, 'A'))
        if (1 == count(s.begin() + i, s.begin() + i + 8, 'I'))
          if (1 == count(s.begin() + i, s.begin() + i + 8, 'D'))
            if (1 == count(s.begin() + i, s.begin() + i + 8, 'U'))
              if (2 == count(s.begin() + i, s.begin() + i + 8, 'N'))
                if (1 == count(s.begin() + i, s.begin() + i + 8, 'Y')) {
                  s.replace(i, 8, "AIZUNYAN");
                  i += 7;
                }
    }
  cout << s << endl;
}

Error: 0

Fixed submission:

// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

// conversion
//------------------------------------------
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T> inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}

// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }

// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c)                                                             \\
  for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())

// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)

// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);

// clear memory
#define CLR(a) memset((a), 0, sizeof(a))

// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x)                                                               \\
  cerr << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \\
       << " " << __FILE__ << endl;

int gcd(int a, int b) {
  int tmp;
  while (a % b == 0) {
    tmp = a % b;
    a = b;
    b = tmp;
  }
}

int lcm(int a, int b) { return a * b / gcd(a, b); }

bool prime_number(int n) {
  vector<bool> i;
  if (n < 2) {
    return false;
  } else if (n == 2) {
    return true;
  }
  if (n % 2 == 0) {
    return false;
  }
  for (int i = 3; i <= n / i; i += 2) {
    if (n % i == 0)
      return false;
    return true;
  }
}

int main() {
  string s;

  while (getline(cin, s)) {
    REP(i, s.size() - 7) {
      if (2 == count(s.begin() + i, s.end() + i + 7, 'A'))
        if (1 == count(s.begin() + i, s.end() + i + 7, 'I'))
          if (1 == count(s.begin() + i, s.end() + i + 7, 'D'))
            if (1 == count(s.begin() + i, s.end() + i + 7, 'U'))
              if (2 == count(s.begin() + i, s.end() + i + 7, 'N'))
                if (1 == count(s.begin() + i, s.end() + i + 7, 'Y'))
                  s.replace(i, 8, "AIZUNYAN");
    }
    cout << s << endl;
  }
}