Cod sursa(job #1000939)

Utilizator alexx.cosmaCosma Cristian Alexandru alexx.cosma Data 23 septembrie 2013 23:32:22
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.47 kb
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;

ifstream fin("ciur.in");
ofstream fout("ciur.out");

const int maxN = 2000005;

int ns[maxN];

int main()
{
    int n;
    fin >> n;
    int nr=0;
    for(int i=2;i<=n;i++)
        ns[i]=1;
    for(int i=3; i<=n; i+=2)
        if(ns[i])
        {
            nr++;
            for (int j = i+i; j<=n; j+=i)
                ns[j]=1;
        }
    fout << nr;

    return 0;
}