Cod sursa(job #323981)

Utilizator RaphyRafailescu Marius Raphy Data 14 iunie 2009 12:18:19
Problema Ciurul lui Eratosthenes Scor 100
Compilator c Status done
Runda Arhiva educationala Marime 0.52 kb
#include <stdio.h>
#include <stdlib.h>   

int main(void)  
{  
int i, j;  
int n, cnt=0;
char prim[2000000];  
FILE *in,*out;      
in=fopen("ciur.in","r");  
out=fopen("ciur.out","w");  
   
fscanf(in,"%d",&n);
//prim=(int*)malloc(n*sizeof(int));  
for (i=2;i<=n;++i)  
	prim[i]=1;  
for (i=2;i<=n;++i)  
	if (prim[i])  
        {  
        	++cnt;  
             	for (j=2*i;j<=n;j+=i)  
                 	prim[j]=0;  
        }  
fprintf(out,"%d\n",cnt);
fclose(in);
fclose(out);  
return 0;  
}