Submission #2462191

---

Source Code Expand

#include <iostream>
#include <climits>
#include <stack>
#include <queue>
#include <string>
#include <set>
#include <map>
#include <math.h>
#include <algorithm>
#include <vector>
 
using namespace std;
 
typedef long long ll;
 
typedef pair<ll,ll> P;
long long int INF = 1e18;
double Pi = 3.141592653589;
const int mod = 1000000007;
// memset(a,0,sizeof(a)); →全部０にする
 
vector<int> G[100005];
std::vector<P> tree[100010];
 
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
 
#define p(x) cout<<x<<endl;
#define e cout<<endl;
#define pe(x) cout<<x<<" ";
#define re(i,a,b) for(i=a;i<=b;i++)
 
ll i,j,k,l,ii,jj;
ll n,m;
ll a,b,c;
ll h,w;

ll ans=0;
ll sum=0;
ll memo,num;
bool dame=false;
bool x[500005];//素数ならtrue

int main(){
	cin>>n;
	
	for(i=1;i<=500000;i++){
		x[i]=true;
	}
	x[1]=false;
	x[2]=true;
	for(i=1;i<=500000;i++){
		if(!x[i])continue;
		for(j=2;j*i<=500000;j++){
			x[i*j]=false;
		}
	}
	k=0;
	for(i=1;i<=500000;i++){
		if(x[i] && i%5==1 && k<n){
			pe(i);
			k++;
		}
	}
	e;

	
	return 0;
				
}

Submission Info

Judge Result