https://esolangs.org/wiki/Dis を解くよ。詳細は dis.nim
fmt""" jump 33 {"_".repeat(32)} {"33 ".repeat(61)} load""" を使えば、34番地メモリから36番地メモリまでをある自由に使ってプログラミングできる
tritsubは三進数でビットごとの引き算(桁上げ無し)
- putc(a) # 標準出力
- a = M[n] = 0 # ゼロクリア
- a = M[n] = tritsub(a, M[n])
- a = M[n] # メモリ読み込み
- a = getc() # 標準入力
- a = M[n] = getc() # 標準入力
- a = M[n]; M[m] = M[n] # M[n] から M[m] へのコピー
{"111222000": "x-(-(1))",
"210021102": "-(y)-(1-(x))",
"210102021": "y-(x)-(1-(y))",
"210210210": "y-(1-(y))",
"102210021": "x-(y-(1))",
"012012012": "y",
"000111222": "x",
"021210102": "y-(x-(y))",
"120120120": "y-(-(1))",
"111111111": "1",
"000000000": "",
"021021021": "-(y)",
"012120201": "y-(-(x))",
"222222222": "-(1)",
"012201120": "y-(x)",
"201201201": "y-(1)",
"021102210": "x-(y)",
"120012201": "y-(x-(1))",
"222111000": "x-(1-(x))",
"000222111": "-(x)",
"201012120": "y-(1-(x))",
"120201012": "y-(x)-(x-(1))",
"111000222": "1-(x)",
"222000111": "x-(1)",
"201120012": "-(1)-(x-(y))",
"102021210": "-(y)-(x-(1))",
"102102102": "1-(y)"}
すくない！！！！！ MalbolgeのCRAZY演算だと全部の関数作れるのにな。ゆるせねぇ。