Ответ:
Узел дерева без потомков- лист
без предков - корневой узел
Uses crt;
var
x,y,a,b:integer;
begin
clrscr;
while true do begin
randomize;
x:=random(10);
y:=random(10);
write('Введите первое число=');read(a);
write('Введите второе число=');read(b);
writeln(x,' ',y);
if ((a=x) and (b=y)) or ((a=y) and (b=x)) then begin
writeln('Вы угадали');
end
else begin
writeln('Вы не угадали');
end;
end;
end.
var a: array [1...n] of integer;
j, k, max: integer:
begin
for j:=1 to n do
readln(a[j]);
sum:=0
For j:=1 to n do
if a[j]mod=0 then sum:=sum*a[j]
Writeln(sum);
end.
===== PascalABC.NET =====
type
reals = file of real;
procedure CreateReals(fn: string; var f: reals);
begin
Rewrite(f, fn);
for var i := 1 to 101 do
Write(f, Random(-50.0, 50.0));
f.Close
end;
function GetAverage(f: reals): real;
begin
Result := f.Elements.Average;
end;
function CountElements(f: reals; m: real) :=
f.Elements.Where(p -> p < m).Count;
begin
var f: reals;
var fn := 'Reals.bin';
CreateReals(fn, f);
Reset(f, fn);
var avg := GetAverage(f);
avg.Println;
CountElements(f, avg).Println
end.
Var a,b,h:integer;
begin
read(a;h);
write(a^a+2*a*sqrt(a^a/4+h*h));
wrteln((h*a*a)/3);
end.