Cod sursa(job #2440012)

Utilizator TheGodFather2131Alexandru Miclea TheGodFather2131 Data 17 iulie 2019 13:36:59
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.42 kb
#include <iostream>
#include <fstream>

using namespace std;

int prime[2000000];
int main()
{
    ifstream fin ("ciur.in");
    ofstream fout ("ciur.out");

    int n, i, j, nr = 1;
    fin >> n;

    for (i = 3; i*i <= n; i+=2){
        if (prime[i] == 0){
            nr++;
            for (j = i+i+i ; j <= n; j += i << 1)
                prime[j] = 1;
        }
    }
    fout << nr;
    return 0;
}