Cod sursa(job #1898062)

Utilizator marianpolmanPolman Marian marianpolman Data 1 martie 2017 20:17:44
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.54 kb
#include <iostream>
#include <bitset>
#include <fstream>
using namespace std;
int main()
{
    int n=2000000,i,c=0,j,k;
    bitset<2000000>ciur;
    ifstream fin("ciur.in");
    ofstream fout("ciur.out");
    for(i=1;i<=n;i++)
        ciur[i]=1;
    for(int i=2;i<=n;i++)
        {
            if(ciur[i]==1)
            {
            for(j=i+i;j<=n;j=j+i)
            ciur[j]=0;
            }
        }
        fin>>n;
        for(i=2;i<=n;i++)
        if (ciur[i]==1)
        c++;
        fout<<c<<endl;
    return 0;
}