Submission #2462058

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
typedef pair<ll, P> E;
#define MOD (1000000007ll)
#define l_ength size
#define PI 3.14159265358979
 
void mul_mod(ll& a, ll b){
    a *= b;
    a %= MOD;
}

void add_mod(ll& a, ll b){
    a += b;
    a %= MOD;
}

int main(void){
	int i,j,n;
	bool isp[60000];
	fill(isp,isp+60000,true);
	isp[1] = false;
	for(i=2; i<=235; ++i){
		if(!isp[i]){
			continue;
		}
		for(j=(i*2); j<=55555; j+=i){
			isp[j] = false;
		}
	}
	cin >> n;
	i = 6;
	n -= 1;
	cout << "2";
	while(n){
		if(isp[i]){
			cout << " " << i;
			--n;
		}
		i += 5;
	}
	cout << endl;
	return 0;
}

Submission Info

Judge Result