Cod sursa(job #933283)

Utilizator YoChinezuWeng Mihai Alexandru YoChinezu Data 29 martie 2013 19:41:24
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.44 kb
#include <fstream>
#include <math.h>

using namespace std;

int v[2000010];

int main(){
    for(int i=2;i<sqrt(2000000);i++)
        if(v[i]==0)
        for(int j=i+i;j<=2000000;j=j+i)
        v[j]=1;
    ifstream in ("ciur.in");
    ofstream out ("ciur.out");
    int n,S;
    S=0;
    in>>n;
    for(int i=2;i<=n;i++){
        if(v[i]==0)
            S++;
    }
    out<<S;
    in.close();
    out.close();
    return 0;
}