Cod sursa(job #1901071)
| Utilizator | Data | 3 martie 2017 18:46:12 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <cstdio>
#define LMAX 2000000
using namespace std;
bool ciur[LMAX+5];
inline void CIUR(){
int d,i;
for(i=4;i<=LMAX;i+=2)
ciur[i]=1;
for(d=3;d*d<=LMAX;d+=2)
if(!ciur[d])
for(i=d*d;i<=LMAX;i+=2*d)
ciur[i]=1;
}
int main(){
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
CIUR();
int n,i,ap=0;
scanf("%d",&n);
for(i=2;i<=n;++i)
if(!ciur[i])
ap++;
printf("%d\n",ap);
fclose(stdin),fclose(stdout);
return 0;
}
