Cod sursa(job #628642)
Utilizator | Data | 1 noiembrie 2011 19:38:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <stdio.h>
long int n,nr=0,i,j;
char prime[2000005];
FILE *f=fopen("ciur.in","r"),*g=fopen("ciur.out","w");
int main()
{
fscanf(f,"%ld",&n);
for(i=2; i<=n; i++){prime[i]=1;}
for(i=2; i<=n; i++){
if(prime[i]==1){
nr++;
for(j=i+i; j<=n; j=j+i){
prime[j]=0;
}
}
}
fprintf(g,"%ld",nr);
return 0;
}