Cod sursa(job #147367)
| Utilizator | Data | 2 martie 2008 20:45:48 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<stdio.h>
#define M 40000
long v[M];
int main()
{long n,i,j;
int k;
FILE *f=fopen("ciur.in","r");
FILE *g=fopen("ciur.out","w");
fscanf (f,"%ld",&n);
for(i=2;i<=n;i++)
v[i]=1;
for(i=2;i<=n;i++)
if(v[i]) {for(j=2*i;j<=n;j=j+i)
v[j]=0;}
for(i=2;i<=n;i++)
if(v[i]) k++;
fscanf(g,"%d\n",k);
for(i=2;i<=n;i++)
if(v[i]) fscanf(g,"%d ",i);
fclose(f);
fclose(g);
return 0;
}