Cod sursa(job #663501)

Utilizator a08iAndrei Ionescu a08i Data 18 ianuarie 2012 16:39:27
Problema Ciurul lui Eratosthenes Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.41 kb
#include <cstdio>

char A[20000005];
int main()
{
  freopen("ciur.in", "r", stdin);
  freopen("ciur.out", "w", stdout);

  int divisors, ttl;
  long T, x, y;
  scanf("%ld", &T);

  for(x=2; x<=T; x++)
  {
    for(y=2; x*y <= T; y++)
    {
      A[x*y]=1;
    }
  }

  for(x=2; x<=T;x++)
  {
    //printf("x: %ld: %d\n", x, A[x]);
    if(A[x] == 1)
    {
      ttl++;
    }
  }

  printf("%ld\n", T-ttl-1);
  return 0;
}