Cod sursa(job #1196139)

Utilizator bpalaniciPalanici Bogdan bpalanici Data 8 iunie 2014 12:28:40
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.48 kb
#include <cstdio>
#include <algorithm>
#include <bitset>
#define N 4000000

using namespace std;
int n,nr;
bitset <N> ciur;
int main()
{
    freopen("1.in","r",stdin);
    freopen("1.out","w",stdout);
    scanf("%d",&n);
    ciur[0]=1;ciur[1]=1;
    for(int i=2;i<=n;i++) ciur[i<<1]=1;
    for(int i=3;i*i<=n;i+=2)
    {
    if(ciur[i]==0) for(int i1=i*i;i1<=n;i1+=i) ciur[i1]=1;
    }
    for(int i=0;i<=n;i++) if(ciur[i]==0) nr++;
    printf("%d",nr);
    return 0;
}