回答編集履歴
1
追記
test
CHANGED
|
@@ -23,3 +23,67 @@
|
|
|
23
23
|
}
|
|
24
24
|
|
|
25
25
|
```
|
|
26
|
+
|
|
27
|
+
|
|
28
|
+
|
|
29
|
+
[追記] やってみた:
|
|
30
|
+
|
|
31
|
+
```C++
|
|
32
|
+
|
|
33
|
+
#include <iostream>
|
|
34
|
+
|
|
35
|
+
#include <vector>
|
|
36
|
+
|
|
37
|
+
#include <algorithm>
|
|
38
|
+
|
|
39
|
+
|
|
40
|
+
|
|
41
|
+
int main() {
|
|
42
|
+
|
|
43
|
+
using namespace std;
|
|
44
|
+
|
|
45
|
+
|
|
46
|
+
|
|
47
|
+
int N;
|
|
48
|
+
|
|
49
|
+
cin >> N;
|
|
50
|
+
|
|
51
|
+
|
|
52
|
+
|
|
53
|
+
vector<int> prime = {2};
|
|
54
|
+
|
|
55
|
+
|
|
56
|
+
|
|
57
|
+
// i = 2, 3, 4...N-1 に対し
|
|
58
|
+
|
|
59
|
+
for ( int i = 2; i < N; ++i ) {
|
|
60
|
+
|
|
61
|
+
// 素数表primeに iを割り切るものがなかったら
|
|
62
|
+
|
|
63
|
+
if ( none_of(prime.begin(), prime.end(),
|
|
64
|
+
|
|
65
|
+
[i](int p) { return i % p == 0; }) ) {
|
|
66
|
+
|
|
67
|
+
// iは素数である。
|
|
68
|
+
|
|
69
|
+
prime.push_back(i);
|
|
70
|
+
|
|
71
|
+
}
|
|
72
|
+
|
|
73
|
+
}
|
|
74
|
+
|
|
75
|
+
// 素数表をプリント
|
|
76
|
+
|
|
77
|
+
for ( int p : prime ) {
|
|
78
|
+
|
|
79
|
+
cout << p << endl;
|
|
80
|
+
|
|
81
|
+
}
|
|
82
|
+
|
|
83
|
+
|
|
84
|
+
|
|
85
|
+
return 0;
|
|
86
|
+
|
|
87
|
+
}
|
|
88
|
+
|
|
89
|
+
```
|