Cod sursa(job #1053192)
Utilizator | Data | 12 decembrie 2013 15:11:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<cstdio>
#include<bitset>
using namespace std;
int N,Cnt,i,j;
bitset<2000005> viz;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&N); Cnt=1;
for(i=3;i*i<=N;i+=2)
if(!viz[i]) {Cnt++; for(j=i*i;j<=N;j+=i) viz[j]=1;}
for(;i<=N;i+=2) if(!viz[i]) Cnt++;
printf("%d\n",Cnt);
return 0;
}