Cod sursa(job #647470)
Utilizator | Data | 11 decembrie 2011 15:16:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
var n,i,nr,j:longint; ok:boolean;
begin
assign(input,'ciur.in');
reset(input);
assign(output,'ciur.out');
rewrite(output);
read(n);
for i:=2 to n do begin
ok:=true;
for j:=2 to i div 2 do if i mod j=0 then ok:=false;
if ok=true then nr:=nr+1;
end;
write(nr);
close(output);
end.