Submission #5938933

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define VV 55555
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int N;
int listP[VV + 1][4];
int counter[4];
int main() {
  cin >> N;
  // cout << N << endl;
  vector< bool > flg(VV + 1);
  FOR(i, 2, VV + 1) {
    if (!flg[i]) {
      for (int j = 2 * i; j <= VV; j += i) {
        flg[j] = true;
      }
    }
  }
  FOR(i, 2, VV + 1) {
    if (!flg[i]) {
      int modulo = i % 5 - 1;
      if (modulo == -1)
        continue;
      else {
        listP[modulo][counter[modulo]] = i;
        counter[modulo]++;
      }
      // printf("%d\n", i);
    }
  }
  // REP(i, 4) { cout << counter[i] << endl; }
  REP(i, N) { printf("%d ", listP[0][i]); }
}

Submission Info

Judge Result