Cod sursa(job #1592503)

Utilizator stefanst77Luca Stefan Ioan stefanst77 Data 7 februarie 2016 18:10:50
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.49 kb
#include <fstream>
#include <bitset>

using namespace std;
bitset <2000002> a;
int main()
{
    ifstream fin ("ciur.in");
    ofstream fout ("ciur.out");
    int n, k, i, j;
    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++;
    }




    fin.close();
    fout.close();
    return 0;
}