Cod sursa(job #201245)
Utilizator | Data | 29 iulie 2008 22:15:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<stdio.h>
#include<bitset>
using namespace std;
int n,rez=1;
bitset<1000000> c;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
int i2;
for(int i=3; i<=n; i+=2)
{
if(c[i>>1])
continue;
rez++;
for(int j=i+(i2=i<<1); j<=n; j+=i2)
c[j>>1]=1;
}
printf("%d\n",rez);
return 0;
}