C++ :

#include <iostream>
#include <vector>
using namespace std;
// 判断一个数字是否是质数的函数
bool isPrime(int num) {
    if (num <= 1) return false;
    if (num == 2) return true;
    if (num % 2 == 0) return false;
    for (int i = 3; i * i <= num; i += 2) {
        if (num % i == 0) return false;
    }
    return true;
}
int main() {
    int start, end;
    cin >> start;
    cin >> end;
    vector<int> primes;
    int sum = 0;
    // 遍历从 start 到 end 的所有整数
    for (int i = start; i <= end; ++i) {
        if (isPrime(i)) {
            primes.push_back(i);
            sum += i;
        }
    }
    // 输出结果
    for (size_t i = 0; i < primes.size(); ++i) {
        cout << primes[i] << " ";
    }
    cout << endl;
    cout << sum;
    return 0;
}