Ladder corner problem by *yuko*

program-id.a.data division.working-storage section.
1 i pic 9(9).
1 j pic 9(9).
1 s pic x(9).
procedure division.a.accept s
move s(1:4)to i
move s(5:)to j
compute i=.5+(i^(2/3)+j^(2/3))^1.5
display i(6- 0^(9999/i):)if j<>9286 go a.

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return to the top page