Cod sursa(job #899357)
Utilizator | Data | 28 februarie 2013 14:07:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<cstdio>
#include<bitset>
using namespace std;
int t,n;
bitset <2000001>s;
void ciur()
{
int i,j;
t=1;
for (i=3;i<=n;i+=2)
{
if (s[i]==0)
{
++t;
for (j=3;i*j<=n;j+=2) s[i*j]=1;
}
}
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n);
ciur();
printf("%d",t);
return 0;
}