Const n=6;
var x:array[1..n] of integer=(-1, 1, 2, -2, -3, 3);
y,z:array[1..n] of integer;
i,i1,i2:integer;
begin
for i:=1 to n do write(x[i]:3);
writeln;
i1:=0; i2:=0;
for i:=1 to n do
if x[i]>0 then begin i1:=i1+1; y[i1]:=x[i]; end
else if x[i]<0 then begin i2:=i2+1; z[i2]:=x[i]; end;
writeln(' Y: Z:');
for i:=1 to n do
if (i1>=i)and(i2>=i)
then writeln(y[i]:3,z[i]:4)
else if i1>=i then writeln(y[i]:3)
else if i2>=i then writeln(z[i]:7);
end.
Результат:
-1 1 2 -2 -3 3
Y: Z:
1 -1
2 -2
3 -3
Var
a:array[1..3,1..3] of integer;
t:array[0..2] of boolean;
k:array[0..2] of integer;
i,j:integer;
res:boolean;
begin
for i := 1 to 3 do
for j := 1 to 3 do
read(a[i,j]);
for i := 0 to 2 do
begin
k[i] := 0;
t[i] := false;
end;
for i := 1 to 3 do
for j := 1 to 3 do
k[a[i,j]] := k[a[i,j]] + 1;
for i := 1 to 3 do
begin
if (a[i,1] = a[i,2]) and (a[i,2] = a[i,3]) then
t[a[i,1]] := true;
if (a[1,i] = a[2,i]) and (a[2,i] = a[3,i]) then
t[a[1,i]] := true;
end;
if (a[1,1] = a[2,2]) and (a[2,2] = a[3,3]) then
t[a[2,2]] := true;
if (a[3,1] = a[2,2]) and (a[2,2] = a[1,3]) then
t[a[2,2]] := true;
res := true;
if (k[1] - k[2] > 1) or (k[1] - k[2] < 0) then
res := false;
if t[1] and ( t[2] or (k[1] = k[2]) ) then
res := false;
if res then
writeln('YES')
else
writeln('NO')
end.
<span>а) 111000111 (2) = 455 (10)
б) </span><span>100011011 (2) = 283 (10)
в) </span><span>1001100101 (2) = 613 (10) и 1001 (2) = 9 (10)
г) </span><span>1001001 (2) = 73 (10) и 11 (2) = 3 (10)</span>
В двоичной системе счисления дробного числа быть не может
0.355=3×10в -1 степени+5×10в -2 степени+5×10в -3 степени
-1, -2 и -3 это степени у десяток