Cod sursa(job #159974)

Utilizator nicolaetitus12Nicolae Titus nicolaetitus12 Data 14 martie 2008 16:30:05
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.5 kb
#include <string.h>
#include <stdio.h>
#define N 2000001
//#define P 150000
int main ()
{FILE *f,*fout;
 f=fopen("ciur.in","r");
 fout=fopen("ciur.out","w");
 long n,i,j,k,S;
 char sir[N];
 //long prim[M];
 fscanf(f,"%ld",&n);
    n=10000;
 memset(sir,0,sizeof(sir));
 for (i=2;i<=n/2;)
 {for (j=2*i;j<=n;j+=i)
  sir[j]=1;
  i++;
  while(sir[i]==1){i++;}

 }

 sir[1]=1;
 sir[2]=0;
 for (S=0,i=1;i<=n;i++)
 {if(!sir[i])S++;
 }
 fprintf(fout,"%ld",S);
 fclose(fout);
 return 0;
}