Cod sursa(job #171214)
Utilizator | Data | 3 aprilie 2008 20:54:29 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<stdio.h>
#define M 2000005
long n,c[M],r;
FILE*f=fopen("ciur.in","r");
FILE*g=fopen("ciur.out","w");
int main()
{long i,j;
fscanf(f,"%ld",&n);
for(i=2;i<n;i++)
if(!c[i]) for(j=2;j<=n/i;j++)
c[i*j]=1;
for(i=2;i<=n;i++)
if(!c[i]) r++;
fprintf(g,"%ld",r);
fcloseall();
return 0;
}