Submission #2462117

---

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
typedef unsigned int ui;
int main(){
	int n;
	cin >> n;
	int isp[55556] = {};
	int i, j; isp[0] = 1; isp[1] = 1;
	for (i = 2; i < 55556; i++) {
		if (isp[i] == 0) {
			for (j = 2 * i; j < 55556; j += i) {
				isp[j] = 1;
			}
		}
	}
	vector<int>s;
	for (i = 0; i < 55556; i++) {
		if (isp[i] == 0 && i % 5 == 1)s.push_back(i);
	}
	for (i = 0; i < n; i++) {
		cout << s[i] << " ";
	}
	cout << endl;
	char nyaa;
	cin >> nyaa;
	return 0;
}

Submission Info

Judge Result