Cod sursa(job #1189387)

Utilizator hasmasandragosHasmasan Dragos hasmasandragos Data 22 mai 2014 18:06:17
Problema Ciurul lui Eratosthenes Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.3 kb
Raporteaza aceasta sursa 
#include <fstream>
#define NMax 2000005
using namespace std;

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

int c,a[NMax],i,j,n;

int main()
{f>>n;
 for (i=2;i*i<=n;i++)
   if (!a[i])
    for (j=2*i;j<=n;j+=i)
     a[j]++;
 for (i=2;i<=n;i++)
  if (!a[i]) c++;
 g<<c;
    return 0;
}