使用编译时递归生成从1到499的素数

#include<iostream>
#include<vector>

using namespace std;

bool is_prime(int n) {
    if (n <= 1) {
        return false;
    }
    for (int i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            return false;
        }
    }
    return true;
}

vector<int> generate_primes(int start, int end) {
    vector<int> primes;
    for (int i = start; i <= end; i++) {
        if (is_prime(i)) {
            primes.push_back(i);
        }
    }
    return primes;
}

int main() {
    vector<int> primes = generate_primes(1, 499);
    for (int prime : primes) {
        cout<< prime << " ";
    }
    cout<< endl;
    return 0;
}