Cod sursa(job #2270870)

Utilizator radugheoRadu Mihai Gheorghe radugheo Data 27 octombrie 2018 17:54:58
Problema Ciurul lui Eratosthenes Scor 50
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.44 kb
#include <fstream>

using namespace std;

int n, x, i, j, d, sol, maxim;

int f[2000001];
int v[2000001];

int main () {
    ifstream fin ("ciur.in");
    ofstream fout("ciur.out");
    fin >> n;
    for (i=2; i<=n; i++)
        if (f[i] == 0)
        	for (j=2*i; j<=n; j+=i)
        		f[j] = 1;
    f[1] = 1;
    f[0] = 1;
    for (i=1; i<=n; i++)
        if (f[i] == 0)
            sol++;
    fout << sol;
    return 0;
}