Skip to main content
2 of 3
added 158 characters in body
Domenico
  • 2.3k
  • 9
  • 25

COW, 183 bytes

oomMMMmoOMMMmoOoomMMMmoOMMMmOomOoMMMmoOmoOmoOMMMMMMmoOMMMmOomOoMMMmoOmoOmoOMMMMMMmoOMMMmOoMOOmOomOomOomOomOomOoMOOMOomoOmoOMOOMoOmoOmoOMOOMoOmoOmoOMOoMMMOOOmooOOOmooOOOmooMMMmoomoOOOM

Try it online!

How

Returns the smaller integer. It increases and decreases both, the first (with precedence to the decreasing one) to reach 0 is the smaller.

[0]: n to be decreased   [1]: n   [2]: m to be increased   [3]: m   [4]: n to be increased   [5]: n   [6]: m to be decreased   [7]: m

i=>=>i=>=<<=>>>==>=<<=>>>==>=<    | set up memory cells as above
[                                 | loop until a cell reaches 0
    <<<<<<[->>[+>>[+>>-=*]*]*]=   | [0]-- [2]++ [4]++ [6]--
]>o                               | print the redundant copy of the smaller

moo ]    mOo <    MOo -    OOO °    OOM i
MOO [    moO >    MoO +    MMM =    oom o
Domenico
  • 2.3k
  • 9
  • 25