Cod sursa(job #596838)
Utilizator | Data | 20 iunie 2011 06:21:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
int main()
{
unsigned int v[100],m=2,j=5,i=1,rm=1,n;
v[0]=2;
v[1]=3;
freopen("ciur.in","r",stdin);
scanf("%d",&n);
fclose(stdin);
for(j=5;j<=n;j+=2)
{
while(j%v[i]!=0)
{
if(i>rm)
{
v[m]=j;
m++;
rm = m/2;
break;
}
i++;
}
i=1;
}
freopen("ciur.out","w",stdout);
printf("%d",m);
fclose(stdout);
return 0;
}