Problem p00154 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>

#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

typedef long long LL;
template <typename T> using V = std::vector<T>;
template <typename T> using VV = std::vector<std::vector<T>>;
template <typename T> using VVV = std::vector<std::vector<std::vector<T>>>;
template <class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template <class T> inline void print(T x) { std::cout << x << std::endl; }
template <class T> inline bool inside(T y, T x, T H, T W) {
  return 0 <= y and y < H and 0 <= x and x < W;
}
inline double distance(double y1, double x1, double y2, double x2) {
  return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}

const int INF = 1L << 30;
const double EPS = 1e-9;
const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy = {0, 1, 0, -1},
                       dx = {1, 0, -1, 0}; // 4近傍（右, 下, 左, 上）

using namespace std;

void solve(vector<pair<int, int>> v, vector<int> q) {
  VV<LL> dp(v.size() + 1, V<LL>(1001, 0));
  dp[0][0] = 1;

  FOR(i, 0, v.size()) {
    FOR(j, 0, dp[0].size()) {
      if (dp[i][j] == 0) {
        continue;
      }

      FOR(k, 0, v[i].second + 1) {
        int x = v[i].first * k;
        if (x < dp[0].size()) {
          dp[i + 1][j + x] += dp[i][j];
        }
      }
    }
  }

  FOE(n, q) { print(dp[dp.size() - 1][n]); }
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  while (true) {
    int M;
    cin >> M;
    if (M == 0) {
      break;
    }
    vector<pair<int, int>> v;
    FOR(_, 0, M) {
      int a, b;
      cin >> a >> b;
      v.emplace_back(make_pair(a, b));
    }

    vector<int> q;
    int G;
    cin >> G;
    FOR(_, 0, G) {
      int n;
      cin >> n;
      q.emplace_back(n);
    }

    solve(v, q);
  }
  return 0;
}


Fixed submission:
#include <bits/stdc++.h>

#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());

typedef long long LL;
template <typename T> using V = std::vector<T>;
template <typename T> using VV = std::vector<std::vector<T>>;
template <typename T> using VVV = std::vector<std::vector<std::vector<T>>>;
template <class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
template <class T> inline void print(T x) { std::cout << x << std::endl; }
template <class T> inline bool inside(T y, T x, T H, T W) {
  return 0 <= y and y < H and 0 <= x and x < W;
}
inline double distance(double y1, double x1, double y2, double x2) {
  return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}

const int INF = 1L << 30;
const double EPS = 1e-9;
const std::string YES = "YES", Yes = "Yes", NO = "NO", No = "No";
const std::vector<int> dy = {0, 1, 0, -1},
                       dx = {1, 0, -1, 0}; // 4近傍（右, 下, 左, 上）

using namespace std;

void solve(vector<pair<int, int>> v, vector<int> q) {
  VV<LL> dp(v.size() + 1, V<LL>(1001, 0));
  dp[0][0] = 1;

  FOR(i, 0, v.size()) {
    FOR(j, 0, dp[0].size()) {
      if (dp[i][j] == 0) {
        continue;
      }

      FOR(k, 0, v[i].second + 1) {
        int x = v[i].first * k;
        if (j + x < dp[0].size()) {
          dp[i + 1][j + x] += dp[i][j];
        }
      }
    }
  }

  FOE(n, q) { print(dp[dp.size() - 1][n]); }
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  while (true) {
    int M;
    cin >> M;
    if (M == 0) {
      break;
    }
    vector<pair<int, int>> v;
    FOR(_, 0, M) {
      int a, b;
      cin >> a >> b;
      v.emplace_back(make_pair(a, b));
    }

    vector<int> q;
    int G;
    cin >> G;
    FOR(_, 0, G) {
      int n;
      cin >> n;
      q.emplace_back(n);
    }

    solve(v, q);
  }
  return 0;
}