Cod sursa(job #1012914)
| Utilizator | Data | 19 octombrie 2013 21:09:35 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 20 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
type vect= array [1..100] of integer;
var v:vect; n,i,j,nr:integer; f,g:text;
begin
assign(f,'ciur.in');reset(f);
assign(g,'ciur.out');rewrite(g);
read(f,n);
for i:= 2 to n do
v[i]:=i;
v[1]:=0;
i:=2; nr:=0;
while i<=n do
begin
j:=i;
while j<=n do
begin
j:=j+i;
v[j]:=0;end;
inc(i);
end;
for i:=1 to n do
if v[i]<>0 then inc(nr);
write(g,nr);
close(g);
end.