Cod sursa(job #599936)

Utilizator andrianAndrian andrian Data 30 iunie 2011 00:50:08
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.47 kb
#include <iostream>
#include <fstream>
#define nmax 2000000

using namespace std;

int n;
bool p[nmax];
#define p (p-2)

int main()
{
    ifstream in("ciur.in");
    in >> n;
    in.close();
    int s=0;
    for(int i=2;i<=n;++i) p[i] = 1;
    for(int i=4;i<=n;i+=2)  p[i] =0;
    for(int i=3;i*i<=n;i+=2)
        for(int j=i*i;j<=n;j+=2*i) p[j] =0;
    for(int i=2;i<=n;++i)
        if(p[i]) ++s;
    ofstream out("ciur.out");
    out << s;
    out.close();
    return 0;
}