ソースコード
#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <math.h>
#include <iomanip>
#include <vector>
#include <queue>
#include <functional>
#include <random>
#include <time.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
int main() {
ll n, p[100010], cnt = 0;
bool f = 0;
cin >> n;
for (int i = 2; i <= n; i++) {
for (int j = 0; j < cnt; j++) {
if (i%p[j]) {
f = 1;
break;
}
}
if (f)f = 0;
else {
p[cnt] = i;
cnt++;
}
}
for (int i = 0; i < cnt; i++) {
if (i == cnt - 1)cout << p[i] << endl;
else cout << p[i] << ' ';
}
return 0;
}