forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathA.cpp
More file actions
40 lines (33 loc) · 1.12 KB
/
A.cpp
File metadata and controls
40 lines (33 loc) · 1.12 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
#define ll long long
using namespace std;
bool isPrime(int n) {
for(int i = 2; i*i <= n; ++i)
if (n % i == 0) return false;
return n > 1;
}
int main() {
ios :: sync_with_stdio(false);
int n;
while (cin >> n) {
vector<int> res;
FOR(i,2,n) if (isPrime(i)) {
int j = i;
while (j <= n) {
res.push_back(j);
j *= i;
}
}
sort(res.begin(), res.end());
cout << res.size() << '\n';
for(int x : res) cout << x << ' '; cout << '\n';
}
}