Submission #6106887

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int N;

bool isPrime(int n) {
    bool rec = true;
    
    for (int i = 2; i*i <= n; i++) {
        if (n % i == 0) {
            rec = false;
            break;
        }
    }

    return rec;
}

int main() {
    cin >> N;

    vector<int> ans;
    for (int i = 2; i <= 55555 && ans.size() != N; i++) {
        if (isPrime(i)) {
            if (i % 5 == 1) {
                ans.push_back(i);
            }
        }
    }

    for (int i = 0; i < ans.size() - 1; i++) {
        cout << ans[i] << " ";
    }
    cout << ans[ans.size() - 1] << endl; 
    
    return 0;
}

Submission Info

Judge Result