Cod sursa(job #1143350)
Utilizator | Data | 15 martie 2014 15:05:41 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <stdio.h>
int main(){
FILE *fin,*fout;
int n,i,d,ct;
fin=fopen("ciur.in","r");
fout=fopen("ciur.out","w");
fscanf(fin,"%d",&n);
ct=0;
for(i=2;i<=n;i++){
d=2;
if(d*d<i&&i%d!=0){
d=d+1;
while(d*d<i&&i%d!=0){
d=d+2;
}
}
if(d*d>i){
ct++;
}
}
fprintf(fout,"%d",ct);
fclose(fin);
fclose(fout);
return 0;
}