CE记录

#include<bits/stdc++.h>
#define int long long
#define maxn 60000
using namespace std;

const int N = 6e4 + 5;

int num;
int n;
int prime[N];
bool visit[N];

int ans[60];

void Prime()
{
	for (int i = 2; i <= maxn; i++)
	{
		if (!visit[i])
			prime[++num] = i;
		for (int j = 1; j <= num && i * prime[j] <= maxn; j++)
		{
			visit[i * prime[j]] = 1;
			if (i % prime[j] == 0)break;
		}
	}
	return ;
}

main()
{
	Prime();
	
	num = 0;
	
	for(int i = 11;i <= maxn && num <= 60;i += 10)
		if(! visit[i])
			ans[++ num] = i;
	
	while (cin >> n)
		for(int i = 1;i <= n;i ++)
			i != n ? cout << ans[i] << ' ' : cout << ans[i] << '\n';
	
	return false;
}

我就我就问我就问问我怎么做你们才能放过我