Cod sursa(job #579931)
| Utilizator | Data | 12 aprilie 2011 16:32:51 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
#include<stdio.h>
#include<bitset>
using namespace std;
bitset<2000010> ciur;
void ciurul()
{
for(int i=3;i<=44723;i+=2)
for(int j=i*i;j<=2000010;j+=i)
ciur[j]=1;
}
int main()
{
freopen("ciur.in","r",stdin);
freopen("ciur.out","w",stdout);
ciurul();
int n;
scanf("%d",&n);
int nr=1;
for(int i=3;i<=n;i+=2)
if(ciur[i]==0)
nr++;
printf("%d",nr);
}