Cod sursa(job #1577330)

Utilizator MaximTMaxim Tiberiu MaximT Data 23 ianuarie 2016 13:23:44
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.49 kb
#include <fstream>
#include <bitset>
using namespace std;
bitset<2000005>a;
int k;

int main()
{
    int i,j,n;
    ifstream fin ("ciur.in");
    ofstream fout ("ciur.out");
    fin>>n;
    for(i=4;i<=n;i=i+2)
        a[i]=1;
    for(i=3;i*i<=n;i=i+2)
        if(a[i]==0)
          for(j=i*i;j<=n;j=j+2*i)
                a[j]=1;
    k=1;

    for(i=3;i<=n;i=i+2)
        if(a[i]==0)
            k++;


    fout<<k<<"\n";
    fin.close();
    fout.close();
    return 0;
}