Activity for DJMcMayhem
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Edit | Post #280912 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Word Set Square [V (vim)], 23 bytes æw|PòlÄxòjVLkîyllv$r $Ð Try it online! Hexdump: 00000000: e677 7c50 f26c c478 f26a 564c 6bee 796c .w|P.l.x.jVLk.yl 00000010: 6c76 2472 2024 d0 lv$r $. (more) |
— | over 3 years ago |
| Comment | Post #280761 |
Will there ever be an input where no battle can be won? For example `10, 3, [50, 60, 70]`? (more) |
— | almost 4 years ago |
| Edit | Post #280781 | Initial revision | — | almost 4 years ago |
| Answer | — |
A: Create an Alphabet Diamond [Brain-Flak], 250 bytes ((((()()()){}){}){}()){(({})[()])}{}(<>)<>{({}<>)<>}<>{(({})[()])}([]){{}((({}))()()){}){}){}()){({}[()])<>((((()()()()){}){}){})<>}{}<>(((((()()()()){}){}){}){}())<>{({}[()])<>(({})())<>}{}{({}[()])<>(({})[()])<>}{}<>((()()()()()){})<>([])}<> Try it online! R... (more) |
— | almost 4 years ago |
| Comment | Post #280708 |
Once again, Japt beats V at an ASCII-art challenge. *Sigh* (more) |
— | almost 4 years ago |
| Edit | Post #280715 |
Post edited: |
— | almost 4 years ago |
| Edit | Post #280715 | Initial revision | — | almost 4 years ago |
| Answer | — |
A: Create an Alphabet Diamond [V (vim)], 21 bytes ¬AZ¬YA|òlÄ26|xx>>YGpH Try it online! Explanation: ¬AZ " Insert every character from A to Z ¬YA " Insert every character from Y to A | " Go back to the beginning of this line ... (more) |
— | almost 4 years ago |
| Comment | Post #280408 |
"No comments allowed" Are languages where alphabetic characters ignored not allowed then? e.g. brainfuck? (more) |
— | almost 4 years ago |
| Edit | Post #280246 | Initial revision | — | almost 4 years ago |
| Answer | — |
A: Tile pyramids on top of each other! [V (vim)], 11 bytes ÀñY>HGpé/Á\ Try it online! Hexdump: 00000000: c380 fe58 c3b1 593e 4847 70c3 a92f c381 ...X..Y>HGp../.. 00000010: 5cc3 bfc3 \... (more) |
— | almost 4 years ago |
| Edit | Post #280245 | Initial revision | — | almost 4 years ago |
| Answer | — |
A: Reverse an ASCII string [Brain-Flak], 12 bytes {({}<>)<>}<> Try it online! # (Implicitly) Read characters from STDIN and place them all on the active stack # While the top of the active stack is not null... { # Push the following value on to the active stack ( ... (more) |
— | almost 4 years ago |
| Comment | Post #279852 |
I know it's not directly related to the challenge, but reading the phrase "D-Flat Minor" gave me an aneurysm. (D-Flat Minor has 6 flats and a double flat, C# minor is just 4 sharps, way easier to work with) (more) |
— | almost 4 years ago |
| Edit | Post #280244 |
Post edited: |
— | almost 4 years ago |
| Edit | Post #280244 |
Post edited: |
— | almost 4 years ago |
| Edit | Post #280244 |
Post edited: |
— | almost 4 years ago |
| Edit | Post #280244 | Initial revision | — | almost 4 years ago |
| Answer | — |
A: The Camelot Wheel [Python 3], 101, 98, 94 bytes First answer! lambda s:f"{(('FCGDAEB'.index(s[0])--ord(s[5])('-'in s)-3('i'in s)-6)%12)+1}"+'BA'['i'in s] Try it online! Readable version: ``` def f(s): n="FCGDAEB".index(s[0])-6 if '-' in s: n -= ord(s[5]-1) if 'i' in s: n -= 3 ... (more) |
— | almost 4 years ago |