Cod sursa(job #1309008)

Utilizator obidanDan Ganea obidan Data 5 ianuarie 2015 04:50:54
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.39 kb
#include <fstream>
using namespace std;
const int NMax = 2000002;
char Ciur[NMax];
int main()
{
    int n,i,j,nr=1;
    ifstream f("ciur.in");
    ofstream g("ciur.out");
    f>>n;
    for(i=3;i*i<=n;i++)
    {
        for(j = i * i;j <= n; j = j + 2*i)
            Ciur[j]=1;
    }
    if(n==1) g<<"0";
    else
    {
        for(i=3;i<=n;i=i+2)
            if(!Ciur[i])nr++;
        g<<nr;
    }
}