输出一串用c++完成的寻找两个整数见所有素数的代码
时间: 2024-12-11 17:21:52 浏览: 43
在 C++ 中,我们可以编写一个程序来找到两个整数之间的所有素数。以下是一个简单的示例,该程序使用了埃拉托斯特尼筛法来查找范围内的素数:
```cpp
#include <iostream>
#include <vector>
// Function to check if a number is prime
bool isPrime(int num) {
if (num <= 1)
return false;
for (int i = 2; i * i <= num; ++i) {
if (num % i == 0)
return false;
}
return true;
}
// Function to find all primes in a given range
std::vector<int> findPrimesInRange(int start, int end) {
std::vector<bool> marked(end + 1, true); // Assume all numbers are prime initially
for (int p = 2; p * p <= end; ++p) {
// If marked[p] is not changed, then it is a prime
if (marked[p])
for (int i = p * p; i <= end; i += p)
marked[i] = false;
}
std::vector<int> primes;
for (int p = start; p <= end && marked[p]; ++p)
primes.push_back(p);
return primes;
}
int main() {
int lower_limit, upper_limit;
std::cout << "Enter the lower and upper limits: ";
std::cin >> lower_limit >> upper_limit;
std::vector<int> primes = findPrimesInRange(lower_limit, upper_limit);
std::cout << "Prime numbers between " << lower_limit << " and " << upper_limit << " are:\n";
for (const auto& prime : primes)
std::cout << prime << " ";
return 0;
}
```
阅读全文
相关推荐


















