Cod sursa(job #369683)
Utilizator | Data | 29 noiembrie 2009 10:48:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<stdio.h>
int main()
{freopen ("ciur.in", "r", stdin);
freopen ("ciur.out", "w", stdout);
long n, s=0, v[519999],j,i,z;
scanf("%d ", &n);
z=n;
for(i=2;i<=z;i++){
v[i]=i;
}
for(i=2;i<=z;i++){
if(v[i]!=0){
s++;
for(j=i+i;j<=n;j=j+i){
v[j]=0;
n++;
}
n=z;
}
}
printf("%d ", s);
return 0;
}