Cod sursa(job #1521257)

Utilizator dcmionutIonut Deaconu dcmionut Data 10 noiembrie 2015 02:54:13
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.38 kb
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int a[2000001];
int main()
{
  int i, j, n, nr = 0;
  ifstream f("ciur.in");
  ofstream g("ciur.out");
  f >> n;
  for (i = 2; i <= sqrt(n); i++) {
    if (a[i] == 0)
      for (j = i*i; j <= n; j += i)
        a[j] = 1;
    nr++;
  }
  g << nr;
  f.close ();
  g.close ();
  return 0;
}