Cod sursa(job #1650342)

Utilizator alexloxNecula Alexandru alexlox Data 11 martie 2016 17:49:10
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.49 kb
#include <iostream>
#include <fstream>

#define MAXN 2000005

using namespace std;

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

int main()
{
    int n;
    f >> n;
    int v[MAXN], k;
    for(int i = 3; i <= n; i+=2)
        v[i] = 1;
    for(int i = 3; i <= n; i+=2)
        if(v[i] == 1)
            for(int j = i*i; j <= n; j=j+2*i)
                v[j] = 0;
    k = 0;
    for(int i = 3; i <= n; i+=2)
        if(v[i] == 1)
            k++;
    g << k;
    return 0;
}