Nitrodon
• Member for 4 years, 8 months
• Last seen this week

brainfuck, 32 bytes ,[[<]>[.>]++++++++++.,[>>]<[-]<] Try it online! The same loop is used for both halves of the pattern. Explanation: , Take first input ...

Brain-Flak Classic, 1271 1247 1239 bytes <>(()){<>((([][][][][])<(((({}){})(({})({}))[])({}(({})({}({})({}{}(<>)))))[])>{()<{}>}{})<{{}}{}>())}{}<>(<(({()(...

Brain-Flak, 204 196 190 bytes {({}<>)<>((((()()()()()){})(({}){})())({}(({})((({}){})(<()>))))())(({<({}<>[({})])>[()]{()(<{}>)}{}<>}{}()<({}<>[({})]...

brainfuck, 20 bytes Saved 1 byte thanks to Jo King. +>,[>,[-<->]<[<],]<. Try it online! Readable output! Takes input two characters at a time, and moves away from the 1 on ...

Haskell, 50 - 6 = 44 bytes -1 byte thanks to Khuldraeseth na'Barya, and -1 byte thanks to Christian Sievers. t=const f=n t n=flip a=n n f o=($t) x=(n>>=) i=o.n Try it online! View answer 21 votes brainfuck, 18 bytes ++++++++++>,[<.>,] Try it online! Prints one newline for each byte of input. Printing spaces instead would add 4 bytes. View answer 20 votes Brain-Flak, 1316 bytes (({})<({()<(({}<>))><>}){(({})[()()]<{([{}]({})<>({}<>))}{}(([({}<>)]<<>({}<>)<>((({})<<>{({}<>)&... View answer 20 votes Brain-Flak, 276 bytes {({}<>)<>}<>{(((()()()()()){})((({}){})())(({})({}{}([{}])(<>))))((()()(){[()]<{}>}{}){()<{{}}>}{}<<>({}({})())>{()(<{}>)}{}... View answer 15 votes Alice, score 7 "T/was"bri@lligandtheslithytovesdidgyreandgimbleinthewabeallmimsywe rethe ... View answer 14 votes Brain-Flak, 1350 bytes {({}(())(<>))<>({(()()()())<{({}[()])<>}{}>}{}<>({<({}[()])>{()(<{}>)}}{}{}<>))<>}<>([[]]){([[]({}()<>)]<&... View answer 13 votes ><>, 233 122 bytes cdacaabbglccgpcbfbbcaacdebbafbebbcebdbealbcpcdbcccdlcdpacbbalccpaalacpbcfafbaab g sandBe o Aviuth Try it online! This started as a golf of mbomb's answer, but ... View answer 13 votes Brain-Flak Classic, 108 bytes {((((((([][][]){}){}){}()){}){}{}[])()()){{}<>{}(<>)}{}((){[](<{}>)}{}){{}<>[({}<[{}]>)](<>)}{}<>(({}()))<>} Try it ... View answer 13 votes brainfuck, 32 bytes ,[[->++++<<+>]>[[-]<<[.[-]<]]>,] Try it online! I used @ as the operation, because its code point (64) is convenient. U is also possible with the ... View answer 12 votes brainfuck, 83 bytes ,[[>+>>>++++[>]<-<<[>]<<-]>>>>[-]<[+<<<<[<]<[[->+<]<]>+[>]>-[<<[<]>+[>]>-]]<... View answer 10 votes Brain-Flak, 112 bytes (([]){[{}]<{({}()){{}<>([{}]<([{}])>)(<>)}<>(({}[({})])[({}{})])<>}{}<>>({}<({}())>)<>([])}{})({()<({}()())>}{}) Try ... View answer 10 votes Alice, 45 bytes /o \i@/.&wqh!]k.&[&w;;?c]dt.n$k&;[.?~:![?+!kq Try it online! Mostly straightforward implementation. Looping n times in Alice is typically done by pushing a return ...

Perl 6, by Ramillies 11 The function series($x) is simply the first 108 terms of the Taylor series for e^x evaluated at i*(x % 8*π). Since e^2πi = 1, this reduces to simply e^ix: the % 8*π serves ... View answer 8 votes Brain-Flak, 188 bytes <>((((()()()){}){}()){}){(({}[()])<({}[(((((()()()()()){}){}){})()){}{}])<>{<>(({})<({}<>({}<>))((){[()](<{}>)}{}){{}(<({}<([]<... View answer 8 votes Brain-Flak, 74 bytes (({}<>)[()])({()<(({})<({([{}]()({}))([{}]({}))}{})>){<>({}[()])}{}>}[()]) Try it online! This uses the same concept as the standard Brain-Flak positive ... View answer 8 votes brainfuck, 126 bytes +++[->+++++<]>[->++++>+++<<],[+<++++++[-<++++>>------<]>[<]<<[>>>>>[--<--.++>]<+.-<.<<<<]&... View answer 7 votes Alchemist, 76 bytes _+0j->2c b+0j->3d 0j+0_+0b->j c+j+x->_+j d+j->x+b+j j+0c+0d->Out_x+Out_" "!b Try it online! Outputs nonzero values infinitely using the formula \$S(n, ...

Alice, 25 bytes }/"regttoo { {/"lifh""@@{ Left: Normal, 1/4 turn clockwise, 1/2 turn, 1/4 turn counterclockwise Right: reflect across horizontal axis, down-right diagonal, vertical axis, up-right ...

Brain-Flak, 66 bytes <>(())<>{({}[()]<(()[{}]<<>{(({}<>{}))<>}>)>)}{}{{}<>{({}<>)<>}}<> Try it online! Row is 0-indexed. # Push 1 (...

Brain-Flak, 1805 bytes (())(()()()())(())(())(()()())(())(())(()()()())(())(())(()()()())(())(()()())(()())(()()())(())(()()()())(())(())(())(())(())(()())(()()()())(()())(()()())(())(()()()())(())(()...

Brain-Flak, 166 bytes <>(((()()())({}){})())<>{({}[()]<({}({}<<>({}[()])((){[()](<()>)}{}){{}((((({})({})){}{}){}))<>(({}<({}())>){()<({}[({})])>}{})(&...

brainfuck, 201 bytes ,[[[-<+>>>+<<]>-[---<+>]<[[-<]>>]<[-]>>[<<,>>>[-[-<++++++++++>]]++++<[->+<]-[----->-<]<]<...

brainfuck, Jo King >>>>>+>,[>++++++[-<-------->]<+>,]<[-[█<█<]++++++++++<]>[-]>>██[>█>>█>]+[<]<<[<]>█<<+>>[...

Alice, 30 bytes /Q.\d3-&+k!*?-n/ o @ \ic/*2&w~ Try it online! Outputs 1 for easy and 0 for hard. The numbers are easy to multiply if and only if the digit sum of the product equals the ...