Cod sursa(job #598655)
| Utilizator | Data | 26 iunie 2011 17:29:51 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
var i,n,nr:longint;
a:array[1..1000] of boolean;
f:text;
procedure mark(i:integer);
var d:integer;
begin
d:=2;
while i*d<=n do begin
a[d*i]:=false;
inc(d);
end;
end;
begin
nr:=0;
assign(f,'ciur.in');
reset(f);
read(f,n);
close(f);
fillchar(a,sizeof(a),true);
a[1]:=false;
for i:=2 to n do
if (a[i]) then begin
inc(nr);
mark(i);
end
else a[i]:=false;
assign(f,'ciur.out');
rewrite(f);
write(f,nr);
close(f);
end.
