Activity for user
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Edit | Post #283036 |
Post edited: |
— | over 3 years ago |
| Edit | Post #283036 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Gamer Meme Creator Scala, 98 83 bytes Saved 15 bytes thanks to Shaggy! ```scala a=>t=>{val w=a.map(.size).max (" "(w-t.size>>1)+t)+:a:+" "(w/2-5)+"BOTTOM TEXT"} ``` Try it online! `a` is the ASCII art, `t` is the string on top. `w` is the size of the longest line in the art, used for centering. A line `x` ... (more) |
— | over 3 years ago |
| Edit | Post #283035 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Guess the language! (Robbers' Thread) Cracks Mark Giraffe's answer: [Forth (gforth)] .( Cops and Robbers) Try it online! (more) |
— | over 3 years ago |
| Edit | Post #283034 |
Post edited: Fix link |
— | over 3 years ago |
| Suggested Edit | Post #283034 |
Suggested edit: Fix link (more) |
helpful | over 3 years ago |
| Edit | Post #283007 |
Post edited: |
— | over 3 years ago |
| Comment | Post #283007 |
@#53196 That's right! How did you find out? (more) |
— | over 3 years ago |
| Edit | Post #283007 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Guess the language! (Cops' Thread) Verbosity, 512 bytes, cracked by Moshi ``` Include Include Include Include Integer:DefineVariable Output:DefineVariable String:DefineVariable String:RedefineVariable> String:RedefineVariable> Output:DisplayAsText DefineMain<> [ MetaFunctions:ExecuteScript ] ``` Try it on... (more) |
— | over 3 years ago |
| Comment | Post #282982 |
Why am I not surprised? :P (more) |
— | over 3 years ago |
| Comment | Post #282997 |
[Forth](https://tio.run/##S8svKsnQTU8DUf//62koOOcXFCsk5qUoBOUnJaUWFWv@/w8A) (more) |
— | over 3 years ago |
| Comment | Post #282965 |
Well, robbers deserve to have upvotes on their answers for their effort IMO. There's a lot less motivation to crack a cop otherwise. (more) |
— | over 3 years ago |
| Edit | Post #282302 |
Post edited: |
— | over 3 years ago |
| Edit | Post #282951 |
Post edited: |
— | over 3 years ago |
| Suggested Edit | Post #282302 |
Suggested edit: (more) |
helpful | over 3 years ago |
| Suggested Edit | Post #282951 |
Suggested edit: (more) |
helpful | over 3 years ago |
| Edit | Post #281373 |
Post edited: |
— | over 3 years ago |
| Edit | Post #281373 |
Post edited: |
— | over 3 years ago |
| Comment | Post #282825 |
I'm not sure this needs to be said; it's a pretty obvious rule, but it might be good to have it written explicitly. (more) |
— | over 3 years ago |
| Comment | Post #282786 |
This is a good idea, but you may want to restrict it to delimiters that won't be part of the output, or you might get `1.2.3.4` while outputting a list of decimals after using `.` as the separator. (more) |
— | over 3 years ago |
| Edit | Post #282537 |
Post edited: |
— | over 3 years ago |
| Comment | Post #282537 |
@#53588 Alright, thanks! (more) |
— | over 3 years ago |
| Edit | Post #282537 |
Post edited: |
— | over 3 years ago |
| Comment | Post #282537 |
@#53588 Wow! Are you sure you don't want to write that last one as your own answer? (more) |
— | over 3 years ago |
| Edit | Post #282537 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Make my number a set Japt, 3 bytes ``` ÆßX ``` Try it online! (don't mind the -Q This is Shaggy's solution. ``` ÆßX Æ Make a range 0, input) and map each number X: ß Run this program again on X ``` Japt, 11 8 bytes Saved 3 bytes thanks to Shaggy! (Shaggy also has a 3-byter ready) ``` gA... (more) |
— | over 3 years ago |
| Comment | Post #282534 |
[39 bytes](https://tio.run/##K6gsycjPM/7/v6AoM69EI00JQkNwQWmJhqamdjWUVauppPn/v6EBAA) (more) |
— | over 3 years ago |
| Comment | Post #282481 |
Sounds like a great idea. Could a [code-bowling] tag be made to work the same way as [highest-score]? (more) |
— | over 3 years ago |
| Edit | Post #282511 |
Post edited: |
— | over 3 years ago |
| Edit | Post #282511 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Versatile self-printer Scala 3 and [Python 3.8 (pre-release)], 2 languages (385 bytes) def String():Any=0 def Int():Any=0 def f(s:String):Any=print(s.replace(chr(81),chr(34)3+s+chr(34)3)) class M: f("""def String():Any=0 def Int():Any=0 def f(s:String):Any=print(s.replace(chr(81),... (more) |
— | over 3 years ago |
| Edit | Post #282509 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Leaderboards are live Libraries are removed when "merge variants" is on. For example, this answer written in `C (clang)` uses a library called `BMPL`, so its header is `C (clang) + BMPL`. While there's nothing wrong with using libraries, this shows up as just `C` instead of `C + BMPL` in the leaderboard. Could that be fix... (more) |
— | over 3 years ago |
| Edit | Post #282319 |
Post edited: |
— | over 3 years ago |
| Edit | Post #282497 | Initial revision | — | over 3 years ago |
| Question | — |
Shuffle a subset of a list Idea shamelessly stolen from caird and rak1507 Shuffle a subset of a list of unique, positive integers with uniform randomness, given the indices of that subset. For example, given the list \$[A, B, C, D, E, F, G, H]\$ and the indices \$[0, 3, 4, 5, 7]\$ (0-indexed), you would extract the list \$[... (more) |
— | over 3 years ago |
| Edit | Post #281550 |
Post edited: |
— | over 3 years ago |
| Comment | Post #281550 |
@#53579 Oh wow, I can't believe I didn't think of that! (more) |
— | over 3 years ago |
| Comment | Post #282449 |
@#53196 I would personally prefer byte count, but why not post another meta question and let people vote on it? Also, thank you so much for the leaderboards! It's wonderful to have them integrated into Codidact. (more) |
— | over 3 years ago |
| Comment | Post #282431 |
It may help to give a short explanation of how negabinary works (convert 110 to 4 + -2 + 0 = 2 or something like that). If that's given, I'm not sure the example code, which may not be helpful for some people anyway, is needed. (more) |
— | over 3 years ago |
| Comment | Post #282455 |
I agree with Quintec. The input format is just plain cumbersome and adds nothing to the challenge. A lot of submissions are probably going to have to spend ~30% of their bytes on just parsing that. I'm not downvoting this challenge, but I'm not going to upvote it either. (more) |
— | over 3 years ago |
| Comment | Post #282449 |
It's possible this happens because of [this line](https://github.com/codidact/qpixel/blob/develop/public/assets/community/codegolf.js#L233), where it keeps the leaderboard from before if it's already loaded. Perhaps sorting the leaderboard in `getLeaderboard` itself might fix it. (more) |
— | over 3 years ago |
| Comment | Post #282426 |
Nice! It's a pity Python can't do `1.&` or even `1.__and__`. (more) |
— | over 3 years ago |
| Comment | Post #282428 |
Nice answer! A link to this would be nice. You could try using [regex101](https://regex101.com/). (more) |
— | over 3 years ago |
| Edit | Post #282441 |
Post edited: |
— | over 3 years ago |
| Edit | Post #282441 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Create a Sudoku [APL (Dyalog Unicode)], 22 bytes ⎕←∘.((1+⍳9)⌽⍨⊣+3×⊢)⍨⍳3 Try it online! Requires zero-indexing. ``` ⎕←∘.((1+⍳9)⌽⍨⊣+3×⊢)⍨⍳3 ⍳3 ⍝ Make the range [0, 2] (row and cols of 3×3 boxes) ∘. ⍨ ⍝ Outer product with itself ⊣+ ⍝... (more) |
— | over 3 years ago |
| Comment | Post #279221 |
Wow, never thought I'd actually see toadj_ used somewhere. +1 (more) |
— | over 3 years ago |