Pagini recente » Cod sursa (job #83465) | Borderou de evaluare (job #1136700) | Cod sursa (job #897593) | Cod sursa (job #2194982) | Cod sursa (job #868682)
Cod sursa(job #868682)
#include <stdio.h>
FILE *in,*out;
int N, cnt;
char prim[2000005];
int main(void)
{
in=fopen("ciur.in", "rt");
out=fopen("ciur.out", "wt");
fscanf(in,"%d", &N);
for (int i = 2; i <= N; ++i)
prim[i] = 1;
for (int i = 2; i <= N; ++i)
if (prim[i])
{
++cnt;
for (int j = i+i; j <= N; j += i)
prim[j] = 0;
}
for(int i=1;i<=N;++i)
if(prim[i])
printf("%d ",i);
fprintf(out,"%d\n", cnt);
fclose(in);
fclose(out);
return 0;
}