...
const int arrSize = 60;
int arr[arrSize];
int sum = 0, prod = 1;
...
for (int i = 0; i < arrSize; i++)
if (arr[i] >= 0)
sum += arr[i];
else
prod *= arr[i];
if (sum <= prod)
cout << "Sum is lesser than the product of the numbers." << endl;
else
{
int maxEl = arr[0];
for (int i = 0; i < arrSize; i++)
if (arr[i] > maxEl)
maxEl = arr[i];
cout << maxEl << endl;
}
...
F=¬(X*Y)+¬(Y+Z)
преобразование:
F=¬X+¬Y+¬Y*¬Z
F=¬X+¬Y(1+¬Z)
F=¬X+¬Y
---------------------------------------------------
XYZ ¬X ¬Y F
000 1 1 1
001 1 1 1
010 1 0 1
011 1 0 1
100 0 1 1
101 0 1 1
110 0 0 0
111 0 0 0
2047₈=2*8³+0*8²+4*8¹+7*8⁰=1024+32+7=1063₁₀
Var
n, i, z: Integer;
begin
Write('n=');
ReadLn(n);
if n = 0 then
WriteLn('z=-1')
else if (n < 0) then
WriteLn('Введено отрицательное число')
else
begin
z := 1;
for i := 1 to n do
z := z * 1 * (3 * i - 1);
WriteLn('z=', z);
end;
end.