Cod sursa(job #697335)
Utilizator | Data | 29 februarie 2012 02:14:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
using namespace std;
#include<cstdio>
#include<bitset>
#define MAX 2000005
bitset <MAX> ciur;
int n,i,j,c;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
for(i=3;i<=n;i=i+2)
if(!ciur[i])
{
c++;
for(j=i+i;j<=n;j=j+i)
ciur[j]=1;
}
printf("%d",c+1);
return 0;
}