Cod sursa(job #1492572)
Utilizator | Data | 27 septembrie 2015 21:25:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
var
a: array[1..20000] of boolean;
i,j,n,r:longint;
fin,fou:text;
begin
r:=0;
assign(fin,'ciur.in');
assign(fou,'ciur.out');
reset(fin);
rewrite(fou);
read(fin,n);
for i:=1 to n do a[i]:=true;
for i:=2 to n do
if a[i]=true then
for j:=2 to n div i do
a[i*j]:=false;
for i:=1 to n do
if a[i]=true then inc(r);
write(fou,r);
close(fin);
close(fou);
end.