Cod sursa(job #368316)
Utilizator | Data | 24 noiembrie 2009 17:51:06 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<stdio.h>
int main()
{freopen ("ciur.in", "r", stdin);
freopen ("ciur.out", "w", stdout);
int n,i,v[200001],x,j=1;
scanf("%d", &n);
for(i=1;i<=n;i++){
v[i]=i;
}
v[1]=0;
for(i=2;i<=n;i++){
if(v[i]!=0){
j++;
for(x=1;x<=n;x++){
v[i*x]=0;
}
}
}
printf("%d", j-1);
return 0;
}