Cod sursa(job #165720)
Utilizator | Data | 26 martie 2008 17:56:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
int main()
{freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
long n,i;
long b[1500];
scanf("%D",n);
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;
}
printf("%d",max);
return 0;
}