Cod sursa(job #2490135)

Utilizator vali_27Bojici Valentin vali_27 Data 9 noiembrie 2019 19:58:26
Problema Ciurul lui Eratosthenes Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.4 kb
#include <bits/stdc++.h>
#define NMAX 2000001
using namespace std;

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

int n,v[NMAX];

int main()
{
    f >> n;
    v[1] = 1;
    v[0] = 1;
    for(int i=2;i<=n;++i)
        if(v[i] == 0)
            for(int j=i+i;j<=n;j+=i)
                v[j] = 1;
    int nr = 0;
    for(int i=1;i<=n;++i)
        if(v[i] == 0)nr++;
    g << nr;

}