Cod sursa(job #752058)

Utilizator jolgauSecret Fidel jolgau Data 27 mai 2012 18:07:41
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.42 kb
#include<fstream>
#include<iostream>
using namespace std;

ifstream f("ciur.in");
ofstream g("ciur.out");

int a[2000000];
int ciur(int n)
{
int i,j,nr=0;
for(i=2; i<=n; i++)
    a[i] = 0;
for(i=2; i<=n; i++)
    if(a[i] == 0)
       {
        nr++;
        for(j=i; j<=n; j+=i)
            a[j] = 1;
       }
return nr;
}

int main()
{
int n;
f>>n;
g<<ciur(n);
f.close();
g.close();
return 0;
}