Cod sursa(job #2428692)

Utilizator Arteni_CristiArteni Cristi Arteni_Cristi Data 6 iunie 2019 02:21:59
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.43 kb
#include <fstream>
#include <cmath>
using namespace std;

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

int t[2000005], n, i, j, x = 0, nr;

int main()
{
  in >> n; nr = 2000005;
  t[0] = t[1] = 1;
  for (i = 2; i <= int(sqrt(nr)); i ++)
      if (t[i] == 0)
         for (j = 2; j <= nr/i; j ++)
             t[i*j] = 1;
  for (i = 1; i <= n; i ++)
      if (t[i] == 0)
         x ++;
  out << x;
  return 0;
}