Cod sursa(job #2430085)

Utilizator CoroloHorjea Cosmin Corolo Data 12 iunie 2019 17:52:31
Problema Ciurul lui Eratosthenes Scor 70
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.51 kb
#include <iostream>
#include <fstream>
#include <math.h>

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

int A[2000005];

int main()
{
      int N, i, j, nr = 0;
      f >> N;
      f.close();
      for (int i = 2; i <= ((int)sqrt(N)); i++)
            if (A[i] == 0)
                  for (int j = i * i; j <= N; j = j + i)
                        A[j] = 1;
      for (int i = 2; i <= N; i++)
            if (A[i] == 0)
                  nr++;

      g << nr;
      g.close();
}