Submission #6434557

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

const int N = (int) 1e5 + 5;

int n;
int nprime;
int p[N], f[N];

void sieve() {
	int LIM = 55555;
	for  (int i = 2; i <= LIM; i++) {
		if (f[i] == 0) f[i] = p[++nprime] = i;
		int j = 0;
		while (j < nprime && p[j] < f[i] && p[j + 1] * i <= LIM) {
			f[p[j + 1] * i] = p[j + 1];
			j++;
		}
	}
}

int main() {
	//freopen(".inp", "r", stdin); freopen(".out", "w", stdout);
	sieve();
	cin >> n;
	for (int i = 1; i <= n; i++) cout << p[i] << " ";
	return 0;
}

Submission Info

Judge Result