Problem p03394 (C++)

Buggy submission (status: Runtime Error):
/////////// <----------------------  Xorcestor_X --------------------->
//////////////
#include <algorithm>
#include <bits/stdc++.h>
#include <deque>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>

using namespace std;
#define endl "\n"
#define ll long long int
#define c(x)                                                                   \
  ll x;                                                                        \
  cin >> x
#define cc(x, y)                                                               \
  ll x, y;                                                                     \
  cin >> x >> y
#define ccc(x, y, z)                                                           \
  ll x, y, z;                                                                  \
  cin >> x >> y >> z
#define db long double
#define fast                                                                   \
  cin.tie(NULL);                                                               \
  cout.tie(NULL);                                                              \
  ios_base::sync_with_stdio(false)
#define inf 200000000000000
#define mod 1000000007
#define mod2 998244353
#define eps 1e-7
#define PI 3.1415926535897932385
#define pb push_back
#define bitc __builtin_popcountll
#define mp make_pair
#define ff first
#define ss second
#define all(ar) ar.begin(), ar.end()
#define len(x) (ll)(x).size()
#define fr(i, a, b) for (ll i = (a), _b = (b); i <= _b; i++)
#define rep(i, n) for (ll i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define frr(i, a, b) for (ll i = (a), _b = (b); i >= _b; i--)
#define foreach(it, ar) for (auto it = ar.begin(); it != ar.end(); it++)
#define fill(ar, val) memset(ar, val, sizeof(ar))
#define print(arr, n)                                                          \
  cout << " :: " << #arr << " :: " << endl;                                    \
  rep(i, n) cout << arr[i] << " ";                                             \
  cout << endl
#define print2(arr, n, m)                                                      \
  cout << " :: " << #arr << " :: " << endl;                                    \
  rep(i, n) {                                                                  \
    rep(j, m) cout << arr[i][j] << " ";                                        \
    cout << endl;                                                              \
  }
#define dyn1(arr, n)                                                           \
  ll *arr = new ll[n];                                                         \
  rep(i, n) arr[i] = 0;
#define dyn2(arr, n, m)                                                        \
  ll **arr = new ll *[(n)];                                                    \
  rep(i, n) arr[i] = new ll[m];                                                \
  rep(i, n) rep(j, m) arr[i][j] = 0
#define carr(arr, n) rep(i, n) cin >> arr[i]
#define carr2(arr, n, m) rep(i, n) rep(j, m) cin >> arr[i][j]
#define debug(a) cout << " :: " << #a << " == " << a << endl
#define debug2(a, b)                                                           \
  cout << " :: " << #a << " == " << a << " :: " << #b << " == " << b << endl
#define watch(x) cerr << (#x) << " is " << (x) << endl
#define debugx(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define time__(d)                                                              \
  for (long blockTime = 0;                                                     \
       (blockTime == 0 ? (blockTime = clock()) != 0 : false);                  \
       debugx("%s time : %.4fs", d,                                            \
              (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef pair<ll, ll> pii;
typedef vector<pii> vii;

inline ll maxim(ll a, ll b) {
  if (a > b)
    return a;
  else
    return b;
}
inline ll minim(ll a, ll b) {
  if (a < b)
    return a;
  else
    return b;
}
inline bool equals(double a, double b) { return fabs(a - b) < 1e-9; }
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }

ll sum(ll *arr, ll n) {
  ll total = 0;
  rep(o, n) { total += arr[o]; }
  return total;
}

ll Extended_gcd(ll a, ll b, ll &x, ll &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  } else {
    ll x1, y1;
    ll g = Extended_gcd(b % a, a, x1, y1);
    x = y1 - (b / a) * x1;
    y = x1;
    return g;
  }
}

bool leap(ll y) {
  if (y % 400 == 0)
    return true;
  if ((y % 4 == 0) && (y % 100 != 0))
    return true;
  return false;
}

ll isprime(ll n) {
  if (n == 1)
    return false;
  if (n == 2)
    return true;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0)
      return false;
  }
  return true;
}

// bool prime[2000010];
// void SieveOfEratosthenes()
// {
//     memset(prime, true, sizeof(prime));
//     prime[1]=false;
//     for (int p=2; p*p<=2000001; p++)
//     {
//         if (prime[p] == true)
//         {
//             for (int i=p*p; i<=2000001; i += p)
//                 prime[i] = false;
//         }
//     }
// }

// vector<ll> prime_vec[1000010];
// void modified_SieveOfEratosthenes()
// {
//     //prime[1]=false;
//     for (int p=2; p*p<=1000001; p++)
//     {
//         if (prime_vec[p].size()==0)
//         {
//             for (int i=p*2; i<=1000001; i += p)
//                 prime_vec[i].pb(p);
//         }
//     }
// }

ll binpow(ll a, ll b) {
  ll res = 1;
  while (b > 0) {
    if (b & 1)
      res = (res * a);
    a = (a * a);
    b >>= 1;
  }
  return res;
}

ll result[1000010];
ll tempo[1000010];
ll per[1000010];

void permutation_exp(ll n, ll x) {
  fr(o, 1, n) { result[o] = o; }

  while (x > 0) {
    if (x & 1) {
      fr(o, 1, n) { tempo[o] = result[o]; }

      fr(o, 1, n) { result[o] = tempo[per[o]]; }
    }

    fr(o, 1, n) { tempo[o] = per[o]; }

    fr(o, 1, n) { per[o] = tempo[tempo[o]]; }
    x >>= 1;
  }
}

ll modpow(ll a, ll b, ll x) {
  ll res = 1;
  while (b > 0) {
    if (b & 1)
      res = (res * a) % x;
    a = (a * a) % x;
    b >>= 1;
  }
  return res;
}

int modInverse(int a, int m) {
  int m0 = m;
  int y = 0, x = 1;
  if (m == 1)
    return 0;
  while (a > 1) {
    // q is quotient
    int q = a / m;
    int t = m;
    // m is remainder now, process same as
    // Euclid's algo
    m = a % m, a = t;
    t = y;
    // Update y and x
    y = x - q * y;
    x = t;
  }
  // Make x positive
  if (x < 0)
    x += m0;
  return x;
}

// ll calc(ll idx)
// {
//   ll ret_val=-1;
//   ll x=arr[idx];
//   if(prime[x])
//   {
//     ret_val=maxim(ret_val,p[x]);
//     p[x]=idx;
//     return ret_val;
//   }
//   else
//   {
//     rep(u,prime_vec[x].size())
//     {
//       ret_val=maxim(ret_val,p[prime_vec[x][u]]);
//       p[prime_vec[x][u]]=idx;
//     }
//     return ret_val;
//   }
// }

// ll lpf[1000001] = {};
//
// void precompute()
// {
//   fr(i,2,1000000)
//   {
//     if(!lpf[i])
//     {
//       for(ll j=i;j<=1000000;j+=i)
//       {
//         if(!lpf[j])
//         lpf[j]=i;
//       }
//     }
//   }
// }
//

vector<ll> adj[1000010];

// ll degree[1000010];
//
// void adj_former(ll n)
// {
//   rep(o,n-1)
//   {
//     cc(a,b);
//     adj[a].pb(b);
//     adj[b].pb(a);
//     degree[a]++;
//     degree[b]++;
//   }
// }

ll visited[1000010] = {0};
void dfs(ll x) {
  visited[x] = 1;
  rep(o, adj[x].size()) {
    if (!visited[adj[x][o]]) {
      dfs(adj[x][o]);
    }
  }
}

ll f(ll x) { return x; }

ll ternary_search(ll l, ll r) { // set the error limit here
  while (r - l > 10) {
    ll m1 = l + (r - l) / 3;
    ll m2 = r - (r - l) / 3;
    ll f1 = f(m1); // evaluates the function at m1
    ll f2 = f(m2); // evaluates the function at m2
    if (f1 > f2)
      l = m1;
    else
      r = m2;
  }
  ll mino = f(l);
  fr(o, l, r) { mino = minim(mino, f(o)); }
  return mino;
}

ll func(ll x) { return (x * (x + 1)) / 2; }

ll brr[1000010];

ll bs(ll low, ll high, ll target) {
  while (low + 3 < high) {
    ll mid = (low + high) / 2;
    // increasing function with inclusion
    if (brr[mid] <= target) {
      low = mid; // included
    } else {
      high = mid - 1; // not included
    }
  }

  frr(o, high, low) {
    if (brr[o] <= target)
      return o;
  }
  return -1; // to check for bugs
}

map<ll, ll> mapping;
ll arr[10000010] = {0};
vector<ll> cont;

bool comp(ll a, ll b) { return a > b; }

int main() {
  fast;

#ifndef ONLINE_JUDGE
  // for getting input from input.txt
  freopen("input.txt", "r", stdin);
  // for writing output to output.txt
  freopen("output.txt", "w", stdout);
#endif

  cout << setprecision(10) << fixed;
  c(n);
  if (n == 3)
    cout << "2 5 63" << endl;
  else if (n == 4)
    cout << "2 5 20 63" << endl;
  else if (n == 5)
    cout << "2 5 20 30 63" << endl;
  else if (n % 2 == 0) {
    cont.pb(2);
    cont.pb(10);
    cont.pb(3);
    cont.pb(9);
    cont.pb(4);
    cont.pb(8);
    cont.pb(6);
    cont.pb(12);
    fr(o, 9, n) { cont.pb(cont[cont.size() + 12]); }

    rep(o, n) cout << cont[o] << " ";
  } else {
    cont.pb(6);
    cont.pb(2);
    cont.pb(10);
    cont.pb(3);
    cont.pb(9);
    cont.pb(4);
    cont.pb(8);
    cont.pb(12);
    fr(o, 9, n) { cont.pb(cont[cont.size() - 8] + 12); }

    rep(o, n) cout << cont[o] << " ";
  }

  return 0;
}


Fixed submission:
/////////// <----------------------  Xorcestor_X --------------------->
//////////////
#include <algorithm>
#include <bits/stdc++.h>
#include <deque>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>

using namespace std;
#define endl "\n"
#define ll long long int
#define c(x)                                                                   \
  ll x;                                                                        \
  cin >> x
#define cc(x, y)                                                               \
  ll x, y;                                                                     \
  cin >> x >> y
#define ccc(x, y, z)                                                           \
  ll x, y, z;                                                                  \
  cin >> x >> y >> z
#define db long double
#define fast                                                                   \
  cin.tie(NULL);                                                               \
  cout.tie(NULL);                                                              \
  ios_base::sync_with_stdio(false)
#define inf 200000000000000
#define mod 1000000007
#define mod2 998244353
#define eps 1e-7
#define PI 3.1415926535897932385
#define pb push_back
#define bitc __builtin_popcountll
#define mp make_pair
#define ff first
#define ss second
#define all(ar) ar.begin(), ar.end()
#define len(x) (ll)(x).size()
#define fr(i, a, b) for (ll i = (a), _b = (b); i <= _b; i++)
#define rep(i, n) for (ll i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define frr(i, a, b) for (ll i = (a), _b = (b); i >= _b; i--)
#define foreach(it, ar) for (auto it = ar.begin(); it != ar.end(); it++)
#define fill(ar, val) memset(ar, val, sizeof(ar))
#define print(arr, n)                                                          \
  cout << " :: " << #arr << " :: " << endl;                                    \
  rep(i, n) cout << arr[i] << " ";                                             \
  cout << endl
#define print2(arr, n, m)                                                      \
  cout << " :: " << #arr << " :: " << endl;                                    \
  rep(i, n) {                                                                  \
    rep(j, m) cout << arr[i][j] << " ";                                        \
    cout << endl;                                                              \
  }
#define dyn1(arr, n)                                                           \
  ll *arr = new ll[n];                                                         \
  rep(i, n) arr[i] = 0;
#define dyn2(arr, n, m)                                                        \
  ll **arr = new ll *[(n)];                                                    \
  rep(i, n) arr[i] = new ll[m];                                                \
  rep(i, n) rep(j, m) arr[i][j] = 0
#define carr(arr, n) rep(i, n) cin >> arr[i]
#define carr2(arr, n, m) rep(i, n) rep(j, m) cin >> arr[i][j]
#define debug(a) cout << " :: " << #a << " == " << a << endl
#define debug2(a, b)                                                           \
  cout << " :: " << #a << " == " << a << " :: " << #b << " == " << b << endl
#define watch(x) cerr << (#x) << " is " << (x) << endl
#define debugx(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#define time__(d)                                                              \
  for (long blockTime = 0;                                                     \
       (blockTime == 0 ? (blockTime = clock()) != 0 : false);                  \
       debugx("%s time : %.4fs", d,                                            \
              (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef pair<ll, ll> pii;
typedef vector<pii> vii;

inline ll maxim(ll a, ll b) {
  if (a > b)
    return a;
  else
    return b;
}
inline ll minim(ll a, ll b) {
  if (a < b)
    return a;
  else
    return b;
}
inline bool equals(double a, double b) { return fabs(a - b) < 1e-9; }
ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }

ll sum(ll *arr, ll n) {
  ll total = 0;
  rep(o, n) { total += arr[o]; }
  return total;
}

ll Extended_gcd(ll a, ll b, ll &x, ll &y) {
  if (a == 0) {
    x = 0;
    y = 1;
    return b;
  } else {
    ll x1, y1;
    ll g = Extended_gcd(b % a, a, x1, y1);
    x = y1 - (b / a) * x1;
    y = x1;
    return g;
  }
}

bool leap(ll y) {
  if (y % 400 == 0)
    return true;
  if ((y % 4 == 0) && (y % 100 != 0))
    return true;
  return false;
}

ll isprime(ll n) {
  if (n == 1)
    return false;
  if (n == 2)
    return true;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0)
      return false;
  }
  return true;
}

// bool prime[2000010];
// void SieveOfEratosthenes()
// {
//     memset(prime, true, sizeof(prime));
//     prime[1]=false;
//     for (int p=2; p*p<=2000001; p++)
//     {
//         if (prime[p] == true)
//         {
//             for (int i=p*p; i<=2000001; i += p)
//                 prime[i] = false;
//         }
//     }
// }

// vector<ll> prime_vec[1000010];
// void modified_SieveOfEratosthenes()
// {
//     //prime[1]=false;
//     for (int p=2; p*p<=1000001; p++)
//     {
//         if (prime_vec[p].size()==0)
//         {
//             for (int i=p*2; i<=1000001; i += p)
//                 prime_vec[i].pb(p);
//         }
//     }
// }

ll binpow(ll a, ll b) {
  ll res = 1;
  while (b > 0) {
    if (b & 1)
      res = (res * a);
    a = (a * a);
    b >>= 1;
  }
  return res;
}

ll result[1000010];
ll tempo[1000010];
ll per[1000010];

void permutation_exp(ll n, ll x) {
  fr(o, 1, n) { result[o] = o; }

  while (x > 0) {
    if (x & 1) {
      fr(o, 1, n) { tempo[o] = result[o]; }

      fr(o, 1, n) { result[o] = tempo[per[o]]; }
    }

    fr(o, 1, n) { tempo[o] = per[o]; }

    fr(o, 1, n) { per[o] = tempo[tempo[o]]; }
    x >>= 1;
  }
}

ll modpow(ll a, ll b, ll x) {
  ll res = 1;
  while (b > 0) {
    if (b & 1)
      res = (res * a) % x;
    a = (a * a) % x;
    b >>= 1;
  }
  return res;
}

int modInverse(int a, int m) {
  int m0 = m;
  int y = 0, x = 1;
  if (m == 1)
    return 0;
  while (a > 1) {
    // q is quotient
    int q = a / m;
    int t = m;
    // m is remainder now, process same as
    // Euclid's algo
    m = a % m, a = t;
    t = y;
    // Update y and x
    y = x - q * y;
    x = t;
  }
  // Make x positive
  if (x < 0)
    x += m0;
  return x;
}

// ll calc(ll idx)
// {
//   ll ret_val=-1;
//   ll x=arr[idx];
//   if(prime[x])
//   {
//     ret_val=maxim(ret_val,p[x]);
//     p[x]=idx;
//     return ret_val;
//   }
//   else
//   {
//     rep(u,prime_vec[x].size())
//     {
//       ret_val=maxim(ret_val,p[prime_vec[x][u]]);
//       p[prime_vec[x][u]]=idx;
//     }
//     return ret_val;
//   }
// }

// ll lpf[1000001] = {};
//
// void precompute()
// {
//   fr(i,2,1000000)
//   {
//     if(!lpf[i])
//     {
//       for(ll j=i;j<=1000000;j+=i)
//       {
//         if(!lpf[j])
//         lpf[j]=i;
//       }
//     }
//   }
// }
//

vector<ll> adj[1000010];

// ll degree[1000010];
//
// void adj_former(ll n)
// {
//   rep(o,n-1)
//   {
//     cc(a,b);
//     adj[a].pb(b);
//     adj[b].pb(a);
//     degree[a]++;
//     degree[b]++;
//   }
// }

ll visited[1000010] = {0};
void dfs(ll x) {
  visited[x] = 1;
  rep(o, adj[x].size()) {
    if (!visited[adj[x][o]]) {
      dfs(adj[x][o]);
    }
  }
}

ll f(ll x) { return x; }

ll ternary_search(ll l, ll r) { // set the error limit here
  while (r - l > 10) {
    ll m1 = l + (r - l) / 3;
    ll m2 = r - (r - l) / 3;
    ll f1 = f(m1); // evaluates the function at m1
    ll f2 = f(m2); // evaluates the function at m2
    if (f1 > f2)
      l = m1;
    else
      r = m2;
  }
  ll mino = f(l);
  fr(o, l, r) { mino = minim(mino, f(o)); }
  return mino;
}

ll func(ll x) { return (x * (x + 1)) / 2; }

ll brr[1000010];

ll bs(ll low, ll high, ll target) {
  while (low + 3 < high) {
    ll mid = (low + high) / 2;
    // increasing function with inclusion
    if (brr[mid] <= target) {
      low = mid; // included
    } else {
      high = mid - 1; // not included
    }
  }

  frr(o, high, low) {
    if (brr[o] <= target)
      return o;
  }
  return -1; // to check for bugs
}

map<ll, ll> mapping;
ll arr[10000010] = {0};
vector<ll> cont;

bool comp(ll a, ll b) { return a > b; }

int main() {
  fast;

#ifndef ONLINE_JUDGE
  // for getting input from input.txt
  freopen("input.txt", "r", stdin);
  // for writing output to output.txt
  freopen("output.txt", "w", stdout);
#endif

  cout << setprecision(10) << fixed;
  c(n);
  if (n == 3)
    cout << "2 5 63" << endl;
  else if (n == 4)
    cout << "2 5 20 63" << endl;
  else if (n == 5)
    cout << "2 5 20 30 63" << endl;
  else if (n % 2 == 0) {
    cont.pb(2);
    cont.pb(10);
    cont.pb(3);
    cont.pb(9);
    cont.pb(4);
    cont.pb(8);
    cont.pb(6);
    cont.pb(12);
    fr(o, 9, n) { cont.pb(cont[cont.size() - 8] + 12); }

    rep(o, n) cout << cont[o] << " ";
  } else {
    cont.pb(6);
    cont.pb(2);
    cont.pb(10);
    cont.pb(3);
    cont.pb(9);
    cont.pb(4);
    cont.pb(8);
    cont.pb(12);
    fr(o, 9, n) { cont.pb(cont[cont.size() - 8] + 12); }

    rep(o, n) cout << cont[o] << " ";
  }

  return 0;
}