hungry sentence code force problem
较一一判断生成素数省时
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 2000000;
bool prime[maxn];
int main()
{
int n;
memset(prime, false, sizeof(prime));
for(int i = 2; i * i < maxn; i++)
{
for(int j = 2; i * j < maxn; j++)
prime[i*j] = true;
}
while(scanf("%d", &n) != EOF)
{
printf("2");
for(int i = 1, j = 3; i < n; j++)
{
if(prime[j] == false)
{
printf(" %d", j);
i++;
}
}
printf("\n");
}
return 0;
}
#include <cstdio>
#include <cstdlib>
#include <cmath>
int main(void) {
int n; scanf("%d", &n);
for (int i = n+1; i <= n+n; ++i) {
printf("%d", i);
if (i != n+n) printf(" ");
}
printf("\n");
return 0;
}