Cod sursa(job #165723)
Utilizator | Data | 26 martie 2008 18:04:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
int main()
{FILE *f=fopen("ciur.in","r");
FILE *g=fopen("ciur.out","w");
long n,i;
long b[1500];
fscanf(f,"%d ",&n);
fclose(f);
int max=1,j;
b[0]=2;
int ok;
for(i=3;i<n+1;i++)
{ok=0;
for(j=0;j<max;j++)
if(i%b[j]==0)
ok=1;
if(ok==0)
b[max++]=i;
}
fprintf(g,"%d ",max);
fclose(f);
return 0;
}