Cod sursa(job #628769)
Utilizator | Data | 2 noiembrie 2011 02:18:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<stdio.h>
bool v[2000005];
int n;
int main(){
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d", &n);
int nr=0;
for(int i=2;i<=n;i++)
if(v[i]==0){
nr++;
for(int j=i;j<=n;j=j+i)
v[j]=1;
}
printf("%d", nr);
return 0;
}