Cod sursa(job #2371731)
| Utilizator | Data | 6 martie 2019 19:15:43 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
#define LMAX 2000000
bitset<LMAX+5> ciur;
void Ciur(int n){
ciur[0]=ciur[1]=1;
for(int d=2;d*d<=n;++d)
if(!ciur[d])
for(int i=d*d;i<=n;i+=d)
ciur[i]=1;
}
int main(){
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n;
scanf("%d",&n);
Ciur(n);
int pr=0;
for(int i=1;i<=n;++i)
if(ciur[i]==0)
++pr;
printf("%d\n",pr);
return 0;
}
