Cod sursa(job #1143631)
Utilizator | Data | 15 martie 2014 19:34:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 60 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
char v[2000000];
int main(){
FILE *fin,*fout;
int n,i,ct,j;
fin=fopen("ciur.in","r");
fout=fopen("ciur.out","w");
fscanf(fin,"%d",&n);
ct=0;
for(i=2;i<=n;i++){
if(v[i]==0){
ct++;
}
for(j=i+i;j<=n;j=j+i){
v[j]=1;
}
}
fprintf(fout,"%d",ct);
fclose(fin);
fclose(fout);
return 0;
}