Cod sursa(job #2151404)

Utilizator blacktundraTudorescu Ana-Maria blacktundra Data 4 martie 2018 14:02:56
Problema Ciurul lui Eratosthenes Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.49 kb
#include <bits/stdc++.h>

using namespace std;

const int nmax=2000001;

ifstream f("ciur.in");
ofstream g("ciur.out");

long long n,v[nmax],k,ciur[nmax];

void Read()
{
    int i,j;
    f>>n;
    for(i=2; i<=n; i++)
        v[i]=i;

    for(i=2; i<=n; i++)
        if(ciur[i]==0)
            for(j=2; j*i<=n; j++)
                ciur[i*j]=1;

    for(i=2; i<=n; i++)
        if(ciur[v[i]]==0)
            k++;
    g<<k;
}

int main()
{
    Read();
    return 0;
}