Cod sursa(job #325943)
Utilizator | Data | 23 iunie 2009 01:09:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
#include<bitset>
using namespace std;
bitset <2000000> a;
int n,i,j,jum,nr;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);jum=n>>1;
for(i=3;i<=n;i+=2)
{
if(a[i>>1]) continue;
for(j=i+(i>>1);j<=jum;j+=i)
a[j]=1;
nr++;
}
printf("%d\n",nr+1);
return 0;
}