Cod sursa(job #2662900)

Utilizator popashtefan10Popa Stefan popashtefan10 Data 24 octombrie 2020 19:51:23
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.51 kb
#include <iostream>
#include <cstdio>

using namespace std;

const int NMAX = 2000000;

bool ciur[NMAX + 5];

int main() {
  freopen("ciur.in", "r", stdin);
  freopen("ciur.out", "w", stdout);
  int n, ans = 1;

  scanf("%d", &n);

  ciur[0] = ciur[1] = true;
  for(int i = 4; i <= n; i += 2) ciur[i] = true;
  int i = 3;
  while(i <= n) {
    if(!ciur[i]) {
      ans++;
      for(int j = 2 * i; j <= n; j += i)
        ciur[j] = true;
    }
    i += 2;
  }
  printf("%d", ans);

  return 0;
}