Cod sursa(job #2430088)

Utilizator CoroloHorjea Cosmin Corolo Data 12 iunie 2019 17:57:51
Problema Ciurul lui Eratosthenes Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.5 kb
#include <stdio.h>

int N, cnt;
char prim[2000005];

int main(void)
{
      int i, j;

      freopen("ciur.in", "r", stdin);
      freopen("ciur.out", "w", stdout);

      scanf("%d", &N);
      for (i = 2; i <= N; ++i)
            prim[i] = 1;
      for (i = 2; i <= N; ++i)
            if (prim[i])
            {
                  ++cnt;
                  for (j = i + i; j <= N; j += i)
                        prim[j] = 0;
            }

      printf("%d\n", cnt);

      return 0;
}