begin
integer procedure IABS(I);
value
I;
integer
I;
IABS ≔ if I < 0 then
- I
else
I;
integer
I,
J,
K;
I ≔ J ≔ K ≔ 1;
begin
array
A[(if IABS(J × K ÷ I) > 3 × I - K then- 60 else 1) :
(if IABS(J × K ÷ I) > 3 × I - K then- 60 else 1)× 3·0 - 1·6 + 10·2],
A2[(if IABS(J × K ÷ I) > 3 × I - K then- 60 else 1)× 3·0 - 1·6 - 4 : (if IABS(J × K ÷ I) > 3 × I - K
then- 60 else 1), (if IABS(J × K ÷ I) > 3 × I - K
then- 60 else 1) × 3·0 - 1·6 - 4 : (if IABS(J × K÷ I) > 3 × I - K then- 60 else 1)];
boolean
B;
switch S ≔ L1,
if (if IABS(J × K ÷ I) > 3 × I - K then- 60 else 1)> 6 thenL1 else L2,
L2;
A[(if IABS(J × K ÷ I) > 3 × I - K then- 60 else 1)] ≔ A2[(if IABS(J × K ÷ I) > 3 × I - K then- 60 else 1),
(if IABS(J × K ÷ I) > 3 × I - K then- 60 else 1)]
≔ (if IABS(J × K ÷ I) > 3 × I - K then- 60 else 1)× 3·0 - 1·6;
B ≔ (if IABS(J × K ÷ I) > 3 × I - K then- 60 else 1) >
6;
L1 :;
goto
if (if IABS(J × K ÷ I) > 3 × I - K then- 60 else 1)> 6 then
L1
else
L2;
L2 :;
for I ≔ 1 step (if IABS(J × K ÷ I) > 3 × I - K then-
60 else 1) until (if IABS(J × K ÷ I) > 3 × I - K
then- 60 else 1) do
A[I] ≔ (if IABS(J × K ÷ I) > 3 × I - K then- 60
else 1) × 3·0 - 1·6;
for I ≔ (if IABS(J × K ÷ I) > 3 × I - K then- 60 else
1),
(if IABS(J × K ÷ I) > 3 × I - K then- 60 else 1) +
1,
(if IABS(J × K ÷ I) > 3 × I - K then- 60 else 1) + 10
do
A[I] ≔ (if IABS(J × K ÷ I) > 3 × I - K then- 60
else 1);
if (if IABS(J × K ÷ I) > 3 × I - K then- 60 else 1) > 6
then
goto S[(if IABS(J × K ÷ I) > 3 × I - K then- 60
else 1) × 3·0 - 1·6]
else
for I ≔ (if IABS(J × K ÷ I) > 3 × I - K then- 60
else 1) step 10 until (if IABS(J × K ÷ I) > 3× I - K then- 60 else 1) - 1 do
for J ≔ (if IABS(J × K ÷ I) > 3 × I - K then-
60 else 1) while (if IABS(J × K ÷ I) > 3× I - K then- 60 else 1) > 6 do
;
I ≔ IABS((if IABS(J × K ÷ I) > 3 × I - K then- 60 else
1));
J ≔ IABS((if IABS(J × K ÷ I) > 3 × I - K then- 60 else
1) × 3·0 - 1·6);
OUTREAL(99, I + J + (if IABS(J × K ÷ I) > 3 × I - K then-
60 else 1) × 3·0 - 1·6 + (if IABS(J × K ÷ I) > 3 × I -
K then- 60 else 1) + A[1]+ A2[1, 1]);
end
end