Cod sursa(job #633835)
Utilizator | Data | 14 noiembrie 2011 22:23:03 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<cstdio>
#include<bitset>
#include<vector>
using namespace std;
int main()
{
bitset<1000000> a; //bitul i ----- 2*i+1
int i,j,n,m=1;
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n/2;i++)
{
if(a[i]==0)
{
for(j=2*i+1;j<=n/2;j+=2*i+1) a[j]=1;
m++;
}
}
printf("%d",m);
return 0;
}