Cod sursa(job #952640)
Utilizator | Data | 23 mai 2013 19:13:20 | |
---|---|---|---|
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 n,i,j,sol;
bitset<2000005> viz;
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
scanf("%d",&n); sol=1;
for(i=3;i*i<=n;i+=2)
if(!viz[i])
{
sol++;
for(j=i*2;j<=n;j+=i) viz[j]=1;
}
for(;i<=n;i+=2) if(!viz[i]) sol++;
printf("%d\n",sol);
return 0;
}