Cod sursa(job #1526275)

Utilizator SirStevensIonut Morosan SirStevens Data 16 noiembrie 2015 08:28:45
Problema Ciurul lui Eratosthenes Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.47 kb
#include <bits/stdc++.h>

using namespace std;

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

int n,v[2000000],p=2;

int main()
{
    in>>n;
    for(int i=2;i<=n;i++)
        v[i]=i;
    for(int i=2;i<=n;i++)
    {

        for(int j=p+1;j<=n;j++)
            if(j%p == 0)
                v[j]=-1;
        if(v[i]!= -1)
            p=i;

    }
    int k=0;
    for(int i=2;i<=n;i++)
        if(v[i]!=-1)
            k++;
    out<<k;
    return 0;
}