Cod sursa(job #1118946)

Utilizator visanrVisan Radu visanr Data 24 februarie 2014 13:59:59
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.46 kb
#include <cstdio>
using namespace std;

const int NMAX = 2000010;

int N, Nr;
bool Prime[NMAX];

int main()
{
    freopen("ciur.in", "r", stdin);
    freopen("ciur.out", "w", stdout);

    scanf("%i", &N);
    for(int i = 2; i <= N; ++ i) Prime[i] = 1;
    for(int i = 2; i <= N; ++ i)
        if(Prime[i])
        {
            Nr ++;
            for(int j = 2 * i; j <= N; j += i)
                Prime[j] = 0;
        }

    printf("%i\n", Nr);
}