Problem p00436 (C++)

Buggy submission (status: Runtime Error):
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

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();
}
template <class T> inline T sqr(T x) { return x * x; }

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#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, c)                                                             \
  for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define exist(s, e) ((s).find(e) != (s).end())
#define range(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) range(i, 0, n)
#define clr(a, b) memset((a), (b), sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x)                                                               \
  cerr << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \
       << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi = acos(-1.0);
const ll INF = 1LL << 62;
const int inf = 1 << 29;

void shufful(vi &cur, int q) {
  vi next;
  int n = cur.size();
  next.resize(n);
  if (q) {
    rep(i, n - q) next[i] = cur[i + q];
    rep(i, q) next[n - q + i] = cur[i];
  } else {
    rep(i, n / 2) next[2 * i] = cur[i];
    rep(i, n / 2) next[2 * i + 1] = cur[n / 2 + i];
  }
  rep(i, 2 * n) cur[i] = next[i];
  return;
}

int main(void) {
  int n;
  cin >> n;
  vi cur;
  rep(i, 2 * n) cur.pb(i + 1);
  int m;
  cin >> m;
  rep(i, m) {
    int q;
    cin >> q;
    shufful(cur, q);
  }

  rep(i, 2 * n) cout << cur[i] << endl;
  return 0;
}

Fixed submission:
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

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();
}
template <class T> inline T sqr(T x) { return x * x; }

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;

#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, c)                                                             \
  for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define exist(s, e) ((s).find(e) != (s).end())
#define range(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) range(i, 0, n)
#define clr(a, b) memset((a), (b), sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x)                                                               \
  cerr << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \
       << " " << __FILE__ << endl;

const double eps = 1e-10;
const double pi = acos(-1.0);
const ll INF = 1LL << 62;
const int inf = 1 << 29;

void shufful(vi &cur, int q) {
  vi next;
  int n = cur.size();
  next.resize(n);
  if (q) {
    rep(i, n - q) next[i] = cur[i + q];
    rep(i, q) next[n - q + i] = cur[i];
  } else {
    rep(i, n / 2) next[2 * i] = cur[i];
    rep(i, n / 2) next[2 * i + 1] = cur[n / 2 + i];
  }
  rep(i, n) cur[i] = next[i];
  return;
}

int main(void) {
  int n;
  cin >> n;
  vi cur;
  rep(i, 2 * n) cur.pb(i + 1);
  int m;
  cin >> m;
  rep(i, m) {
    int q;
    cin >> q;
    shufful(cur, q);
  }

  rep(i, 2 * n) cout << cur[i] << endl;
  return 0;
}