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