Cod sursa(job #649742)

Utilizator FIIBCPBuzila Octavian Calin FIIBCP Data 16 decembrie 2011 17:31:01
Problema Ciurul lui Eratosthenes Scor 0
Compilator c Status done
Runda Arhiva educationala Marime 0.45 kb
#include<stdio.h>
#define Nmax 200000
int main()
{
  unsigned long n,k=0,i,j;
 int a[Nmax];
 FILE *f=fopen("ciur.in","r");
 FILE *g=fopen("ciur.out","w");
 fscanf(f,"%d",&n);
 for (i=2;i<=n;i++)
    a[i]=1;
 for (i=2;i<=n;i++)
      if (a[i]==1)
        {
         k++;
         for (j=2*i;j<=n;j=j+i)
            a[j]=0;
         }
  fprintf(g,"Sunt %u numere prime mai mici sau egale ca %u",k,n);
  fclose(f);fclose(g);
  return 0;
}