Problem p03285 (C++)

Buggy submission (status: Runtime Error):
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
  out << "(" << o.first << "," << o.second << ")";
  return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> V) {
  for (int i = 0; i < V.size(); i++) {
    out << V[i];
    if (i != V.size() - 1)
      out << " ";
  }
  return out;
}
template <class T>
ostream &operator<<(ostream &out, const vector<vector<T>> Mat) {
  for (int i = 0; i < Mat.size(); i++) {
    if (i != 0)
      out << endl;
    out << Mat[i];
  }
  return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const map<S, T> mp) {
  out << "{ ";
  for (auto it = mp.begin(); it != mp.end(); it++) {
    out << it->first << ":" << it->second;
    if (mp.size() - 1 != distance(mp.begin(), it))
      out << ", ";
  }
  out << " }";
  return out;
}

/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

void solveA() {
  ll N, K;
  cin >> N >> K;
  if (N % K == 0)
    cout << 0 << endl;
  else
    cout << 1 << endl;
}
void solveB() {
  ll N;
  cin >> N;
  vector<int> dp(1000);
  dp[0] = true;
  for (int i = 0; i < 100; i++) {
    for (int j = 0; j < 1000; j++) {
      if (dp[j]) {
        dp[j + 4] = true;
        dp[j + 7] = true;
      }
    }
  }
  if (dp[N])
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
void solveC() {}
void solveD() {}
int main(void) {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  //    solveA();
  solveB();
  //    solveC();
  //    solveD();
  return 0;
}


Fixed submission:
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
  out << "(" << o.first << "," << o.second << ")";
  return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> V) {
  for (int i = 0; i < V.size(); i++) {
    out << V[i];
    if (i != V.size() - 1)
      out << " ";
  }
  return out;
}
template <class T>
ostream &operator<<(ostream &out, const vector<vector<T>> Mat) {
  for (int i = 0; i < Mat.size(); i++) {
    if (i != 0)
      out << endl;
    out << Mat[i];
  }
  return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const map<S, T> mp) {
  out << "{ ";
  for (auto it = mp.begin(); it != mp.end(); it++) {
    out << it->first << ":" << it->second;
    if (mp.size() - 1 != distance(mp.begin(), it))
      out << ", ";
  }
  out << " }";
  return out;
}

/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

void solveA() {
  ll N, K;
  cin >> N >> K;
  if (N % K == 0)
    cout << 0 << endl;
  else
    cout << 1 << endl;
}
void solveB() {
  ll N;
  cin >> N;
  vector<int> dp(1000);
  dp[0] = true;
  for (int i = 0; i < 100; i++) {
    for (int j = 0; j < 500; j++) {
      if (dp[j]) {
        dp[j + 4] = true;
        dp[j + 7] = true;
      }
    }
  }
  if (dp[N])
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
void solveC() {}
void solveD() {}
int main(void) {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  //    solveA();
  solveB();
  //    solveC();
  //    solveD();
  return 0;
}