Cod sursa(job #1814417)

Utilizator gundorfMoldovan George gundorf Data 23 noiembrie 2016 22:39:15
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.48 kb
#include <iostream>
#include <fstream>
#define Nmax 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int ciur[Nmax];
void Ciur (int n)
{
    int i,j,nr=0;
    ciur[2]=1;
    for (i=3;i<=n;i=i+2)
        ciur[i]=1;
    for (i=2;i*i<=n;i++)
        if (ciur[i])
        for(j=2;j<=n/i;j++)
        ciur[i*j]=0;
    for (i=1;i<=n;i++)
        if (ciur[i]==1) nr++;
    fout<<nr;
}
int main()
{int n;
fin>>n;
Ciur(n);
    return 0;
}