Cod sursa(job #1016438)
Utilizator | Data | 26 octombrie 2013 11:37:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <stdio.h>
int vector[2000000];
int main()
{
int i,n;
FILE *f=fopen("ciur.in","r");
FILE *g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
int prim[n];
for(i=1;i<=n;i++)
{
prim[i]=1;
}
for (i=2;i<=n;i++)
{
if (prim[i])
{
int j;
for (j=2*i;j<=n;j+=i)
{
prim[j]=0;
}
fprintf(g,"%d ",i);
}
}
fclose(f);fclose(g);
return 0;
}