Activity for Jo King
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Comment | Post #279688 |
Another way might be to keep two counters, and output Fizz/Buzz when they reach 3/5 (and then reset them) (more) |
— | almost 3 years ago |
| Edit | Post #279763 | Initial revision | — | almost 4 years ago |
| Answer | — |
A: Output 256 in many different ways [Raku], 18 solutions 256 ٢٥٦ ۲۵۶ ߂߅߆ ২৫৬ ᠒᠕᠖ 𑄸𑄻𑄼 4⁴ 0x100 ord Q`Ā` ''^'LKH' 888-88-88-88-88-88-88-88-8-8 99+99+9+9+9+9+9+9+?9+?9+?9+?9 ($=3333333)&&m|(3)(3)(3)(3)|&&$3$3 [[];[];[];[]]×[[];[];[];[]]×[[];[];[];[]]×[[];[];[];[]] "{"{7%%7%7}{7%7}7"%7}{"{7%%7%7}{7%%7%7}7"%7}{"{7%%7%7... (more) |
— | almost 4 years ago |
| Comment | Post #279684 |
Sigh, Unary, score 256 (more) |
— | almost 4 years ago |
| Comment | Post #279365 |
Is the STDERR restriction really necessary? If the program outputs the correct output before terminating with an error, is that really a reason to disregard them? (more) |
— | almost 4 years ago |
| Comment | Post #279660 |
Answers may want to specify what version of Befunge (e.g 93 or 98) and/or the interpreter they are using, since there are some substantial differences. (more) |
— | almost 4 years ago |
| Comment | Post #279665 |
You can also do `"n"` where `n` has the char code you want. This fails for 34 (`"`), and starts to take up more bytes above 128, but is usually more golfy than trying to work it out arithmetically (more) |
— | almost 4 years ago |
| Comment | Post #279640 |
[20 bytes](https://tio.run/##S0pNK81LT9W1tNAtqAQz//@3M9VWttJVrotXsbNS1ok3NdXWcfj/3yM1JydfRyE8vygnRZELAA) (more) |
— | almost 4 years ago |
| Comment | Post #279639 |
I would recommend allowing programs to reverse all of STDIN as well. Also, forcing an extra newline to be output rather than allowing it to be optional feels like it makes the challenge more complex than it needs to be. Also, do we have to handle empty inputs? (more) |
— | almost 4 years ago |
| Comment | Post #279318 |
Hi everyone. I'm really sorry for not noticing this Meta post earlier, but I've accepted the offer to be a temporary moderator for the site while we jumpstart the Codidact Code Golf community! Thanks for having faith in me. (more) |
— | almost 4 years ago |
| Edit | Post #279559 | Initial revision | — | almost 4 years ago |
| Answer | — |
A: Shape of an array [Raku], 32 bytes {map +,($,[0]...^9 ge.gist)} Try it online! It's difficult to tell the difference between one element arrays and just plain numbers, since Raku translates between the two. However, `gist` returns the list formatted with brackets surrounding it, so we are able to ... (more) |
— | almost 4 years ago |
| Comment | Post #279301 |
What optimisations is TIO missing? As far as I know, it is using the reference interpreter provided by the language's authors (which itself has a number of bugs to exploit). Also, the shortest on SE is [592 bytes](https://codegolf.stackexchange.com/a/161605/76162) (more) |
— | almost 4 years ago |
| Comment | Post #279327 |
You can golf this pretty easily by removing all the whitespace. I'm not sure what restricted character set you've decided to program this under, since it has quotes and an `x` in it, both of which could surely be used elsewhere to make it shorter. (more) |
— | almost 4 years ago |
| Comment | Post #279255 |
[32 bytes](https://tio.run/##VcxBCsIwEEDRvacYcJPgBGYyKW2F9i4jXShoLNJFcvq0Wgl0@/j8OS/3d5RSdHjq6zYpJMzXNA6kcTJ8UZMxuWxtmT@PuBg17AmhZWsBztCcKhNj8F/dWCo3RBj6fq9DZela/C2OtaBj3/0nXNl5lD3emMoK) if you don't mind 0 being `False` else [35](https://tio.run/##VcxNCsIwEEDhvacYcDOhE5hJUtoK9S4jXShoLNJFcvrYHwm4/Xi8... (more) |
— | almost 4 years ago |
| Edit | Post #279267 | Initial revision | — | almost 4 years ago |
| Answer | — |
A: Length of a Sumac Sequence [Raku], 19 bytes {(|@,-...0>)-1} Try it online! { } # Anonymous code block ... # Create a sequence |@ # Starting with the input ,- # With each element being the difference between the previous two ... (more) |
— | almost 4 years ago |
| Edit | Post #279239 |
Post edited: |
— | almost 4 years ago |
| Edit | Post #279239 | Initial revision | — | almost 4 years ago |
| Answer | — |
A: Partial Sums of Harmonic Series [Raku], 27 bytes {+(\+...>=$)} Try it online! { } # Anonymous code block \+ # Get the partial sum of 1 X/ # 1 over each of 1.. # All positive integers ...>=$ # Take fr... (more) |
— | almost 4 years ago |
| Edit | Post #279230 |
Post edited: |
— | almost 4 years ago |
| Edit | Post #279230 | Initial revision | — | almost 4 years ago |
| Answer | — |
A: Evaluate a single variable polynomial equation [Raku], 19 bytes (Z(X0..)).sum Try it online! Is it concerning that my solution is over 30% asterisks? Explanation ( ).sum # Get the sum of Z( ) # The input list zip multiplied by X # The second input to the power of 0... (more) |
— | almost 4 years ago |
| Edit | Post #279229 |
Post edited: |
— | almost 4 years ago |
| Edit | Post #279229 | Initial revision | — | almost 4 years ago |
| Answer | — |
A: Prime Difference [Raku], 33 bytes {1+(3...{($^a...&is-prime)>=$})} Try it online! Anonymous code block that takes a number and returns a number. Explanation { } # Anonymous code block (3...{ }) # Increment from 3 until ( ... (more) |
— | almost 4 years ago |
| Comment | Post #279189 |
I was also thinking of reposting the quine question, but you beat me to it. One thing that I was thinking of changing was to allow function submissions, which would let some answers be somewhat distinct from the old question. (more) |
— | almost 4 years ago |