std::vector<int>
primes(
size_tmax) {
13std::vector<int> res;
14std::vector<bool> is_not_prime(max + 1,
false);
15 for(
size_ti = 2; i <= max; i++) {
16 if(!is_not_prime[i]) {
17res.emplace_back(i);
18}
19 for(
intp : res) {
20 size_tk = i * p;
21 if(k > max) {
22 break;
23}
24is_not_prime[k] =
true;
25 if(i % p == 0) {
26 break;
27}
28}
29}
30 returnres;
31}
32 34int main() {
35std::cout <<
"Calculate primes up to:\n>> ";
36 intn = 0;
37std::cin >> n;
38std::vector<int> ans =
primes(n);
39 for(
intp : ans) std::cout << p <<
' ';
40std::cout << std::endl;
41}
primesstd::vector< int > primes(size_t max)
Definition prime_numbers.cpp:12 mainint main()
Definition prime_numbers.cpp:34RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4