Cod sursa(job #1226487)

Utilizator vevuiocsaIocsa Valeriu Ionut vevuiocsa Data 5 septembrie 2014 17:42:48
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.52 kb
#include <iostream>
#include <fstream>
using namespace std;
int N,c;
bool IsPrime[2000001];

int main()
{

    ifstream fin("ciur.in");
    fin>>N;
    c=0;
    for(int i=2;i<=N; i++)
        IsPrime[i]=true;
    for(int i=2;i<=N; i++)
        if(IsPrime[i]==true)
            for(int j=2*i;j<=N;j=j+i)
                IsPrime[j]=false;
    for(int i=2;i<=N;i++)
        if(IsPrime[i]==true)
            c++;
    ofstream fout("ciur.out");
    fout<<c;
    fin.close();
    fout.close();
    return 0;
}