Cod sursa(job #1881942)
Utilizator | Data | 16 februarie 2017 20:53:53 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
const int N=2000005;
bitset <N> b;
int v[N];
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
int n,i,j,nr=0;
scanf("%d",&n);
for(i=2;i*i<=n;i++){
if(!b[i]){
for(j=i*i;j<=n;j+=i) b[j]=1;
}
}
for(i=2;i<=n;i++){
if(!b[i]) nr++;
}
printf("%d\n",nr);
return 0;
}