Cod sursa(job #154591)
Utilizator | Data | 11 martie 2008 12:18:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <stdio.h>
char v[2000005];
int w[1009];
int main(){
int n,i,k=0,j,nr=0;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=2;i<=n;i++)
if(!v[i]){
nr++;
for(j=i+i;j<=n;j+=i)
v[j]=1;
}
printf("%d",nr);
}