Cod sursa(job #935520)

Utilizator apopeid14Apopei Daniel apopeid14 Data 3 aprilie 2013 19:25:57
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.38 kb
#include<fstream>
#define N 2000002
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool prim[N];
int n,s;
int ciur(){
    int i,j;
    for (i=2;i<=n;i++) prim[i]=1;
    for(i=2;i<=n;i++)
        if(prim[i]){
            s++;
        for (j=i+i;j<=n;j+=i) prim[j]=0;
    }
    return s;
}
int main(){
    in>>n;
    out<<ciur();
    return 0;
}