Var ar:array[1..10] of integer;
i,s:integer;
begin;
for i:=1 to 10 do
readln(ar[i]);
writeln('OK:');
for i:=1 to 10 do
if (i mod 2=0) and (ar[i] mod 2=0) then writeln(ar[i]);
<span>end.</span>
Графические, комбинированные, текстовые и тд я енезнаю
Сортировка методом пузырька:
const n=10;
Var a:array[1..n] of integer; i,j,b:integer;
Begin
for i:=1 to n do read(a[i]);
for i:=1 to n-1 do
for j:=i+1 to n do
if a[j]<a[i] then
begin
b:=a[i];
a[i]:=a[j];
a[j]:=b;
end;
for i:=1 to n do write(a[i],' ');
End.
AB = 3
BC = 2
CE = 2
EF = 3
AF = 3 + 2 + 2 + 3 = 10
AB = 3
BC = 2
CE = 2
ED = 1
DF = 1
AF = 3 + 2 + 2 + 1 + 1 = 9
Кратчайший путь 9
Program z1;
var y:integer;
x:byte;
begin
x:=4;
while x<=12 do begin
y:=x*x-2+3*x;
writeln('x=',x,' ','y=',y);
x:=x+4
end;
readln
<span>end.</span>