Activity for Moshi
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Comment | Post #284201 |
Whoopsies, I don't know how that went unnoticed. I've fixed it (more) |
— | 29 days ago |
| Edit | Post #284201 |
Post edited: Recursive function name is included in byte count |
— | 29 days ago |
| Edit | Post #290615 | Initial revision | — | 10 months ago |
| Answer | — |
A: Plain black webpage HTML, 25 bytes ```html {background:#000} ``` Not really sure if this is a legal solution, but technically you can open it in your browser... (more) |
— | 10 months ago |
| Comment | Post #289439 |
It's the same length `갠긂갠밂乘감뒄뀢감雙강밅剩` (more) |
— | over 1 year ago |
| Edit | Post #289439 | Initial revision | — | over 1 year ago |
| Answer | — |
A: Reverse the bits in a Byte [Sclipting], (UTF-16) 26 bytes ``` 갠긂갠밂乘감뒄뀢감雙갿및剩 ``` Uses a formula I found here >```c >unsigned char b; // reverse this (8-bit) byte >b = (b 0x0202020202ULL & 0x010884422010ULL) % 1023; >``` (more) |
— | over 1 year ago |
| Edit | Post #287816 |
Post edited: Add "official" help text |
— | almost 2 years ago |
| Suggested Edit | Post #287816 |
Suggested edit: Add "official" help text (more) |
helpful | almost 2 years ago |
| Edit | Post #287204 | Initial revision | — | about 2 years ago |
| Answer | — |
A: Mediocre pop count Python, 89 bytes ```python lambda l,g=lambda c:ord(c).bitcount():[i for i in l if min(map(g,l))<g(i)<max(map(g,l))] ```` Attempt This Online! (more) |
— | about 2 years ago |
| Comment | Post #287194 |
Both of these problems are solved by the `*`. See https://tio.run/##y0osSyxOLsosKNHNy09J/Z9m@7/Y1q5Yr7ggJ7NEQz86LjE1M780Vks/U/N/cn5ecX5Oql5OfrpGmkYCWKYICMCMBE3N/wA (more) |
— | about 2 years ago |
| Comment | Post #287194 |
[Splitting is shorter](https://tio.run/##y0osSyxOLsosKNHNy09J/Z9m@7/Y1q5Yr7ggJ7NEQz86LjE1M780Vks/U/N/cn5ecX5Oql5OfrpGmkZCok@Ja5FfYkhqgqbmfwA)
```
s=>s.split(/[^aeiou]*/i)
``` (more) |
— | about 2 years ago |
| Edit | Post #287185 | Initial revision | — | about 2 years ago |
| Answer | — |
A: Just the vowels please [Sclipting], (UTF-16) 22 bytes ```text 놵멡뉖땯더굅낔뭕뇐虛移 ``` Nothing complicated, just replaces the regex `[^aeiouAEIOU]` with the empty string. (more) |
— | about 2 years ago |
| Comment | Post #287132 |
Make that an answer and I'll upvote it ;) (more) |
— | about 2 years ago |
| Comment | Post #287120 |
Done👍Someday I'll get around to updating the leaderboard script to fix issues like these (more) |
— | about 2 years ago |
| Edit | Post #287120 |
Post edited: |
— | about 2 years ago |
| Edit | Post #287132 | Initial revision | — | about 2 years ago |
| Question | — |
Up to date JavaScript Try-It-Online Try it online doesn't support the latest JavaScript features such as optional chaining or null coalescence, which are very useful character-saving operators. Is there another site like TIO, but which uses an updated JavaScript engine? I don't really want to ask people to copy-paste the code into t... (more) |
— | about 2 years ago |
| Comment | Post #287131 |
> You may choose to take input with any 2 distinct characters representing a knight and an empty square
Can I use a two-dimensional Boolean array? (I mean, I suppose technically for a given definition of a "character", I could use ascii codepoints 0 and 1.... (more) |
— | about 2 years ago |
| Edit | Post #287095 |
Post edited: |
— | about 2 years ago |
| Edit | Post #287120 | Initial revision | — | about 2 years ago |
| Answer | — |
A: The holeyest base Sclipting, (UTF-16) 86 bytes ```text 標갠 관上가①要❶❹剩걉눑감⓶重右갰雙⓷加⓶❸分終⓷棄終并❶訂乾⓶折❷同終長괐縮⒈棄丟 ``` Explanation: ```text Input n 標 갠 관上 for b from 2 to 16 가 s = 0 ① n' = n 要 while n' is not 0 ❶❹剩 x = n' mod b 걉눑감 byte array 00 00 01 00 10 01 01 10 00 01 00 01 00 00 00 ... (more) |
— | about 2 years ago |
| Comment | Post #287096 |
I mean here: https://software.codidact.com/ (more) |
— | about 2 years ago |
| Comment | Post #287096 |
You probably wanted to post on our Software site (more) |
— | about 2 years ago |
| Edit | Post #287095 | Initial revision | — | about 2 years ago |
| Answer | — |
A: 55 fruit salad: choose your own Kolmogorov complexity [Python 3], 325 322 bytes -3 bytes thanks to steffan153! ```python from base64 import n=int.frombytes(b85decode('8C^#Z9Uor=^}nk`yLA}AWmC>M4TN(sPp`fvySOeqafPpzk0!=hK2{h9DQZ9#JvR$o@^Bj)76Q|8U{@9v3>hyB9Zvx)9|;A2pJv3OHB+p^^q&7X=p=1f0PFWPt=oaR$}kMV<qq(4(9JlEBeS0=2NDO9hjVN+}6JU@C'),'big') while n... (more) |
— | about 2 years ago |
| Edit | Post #282836 |
Post edited: I messed up the markdown again |
— | about 2 years ago |
| Edit | Post #282836 |
Post edited: |
— | about 2 years ago |
| Comment | Post #282836 |
I'm very confused as to how that code even works but thanks lol. (more) |
— | about 2 years ago |
| Comment | Post #287026 |
Note: Tag synonyms are also Coming Soon(TM) so multiple spellings will also be less of an issue then :) (more) |
— | about 2 years ago |
| Comment | Post #286989 |
Could you include a test case with overlapping beacons? (more) |
— | about 2 years ago |
| Edit | Post #282836 |
Post edited: |
— | about 2 years ago |
| Edit | Post #282836 |
Post edited: |
— | about 2 years ago |
| Edit | Post #286632 |
Post edited: |
— | about 2 years ago |
| Edit | Post #285511 |
Post edited: |
— | about 2 years ago |
| Edit | Post #286632 | Initial revision | — | over 2 years ago |
| Answer | — |
A: Make a frequency table (histogram) [JavaScript (Node.js)], 38 32 bytes -6 bytes thanks to Shaggy! ```javascript a=>a.map(v=>d[v]=-d[v],d={})&&d ``` Try it online! Basically just this but returning the result (more) |
— | over 2 years ago |
| Comment | Post #286603 |
At least in C/C++ you can abuse preprocessor directives to just do
```
#ifdef A BCDEFGHIJKLMNOPQRSTUVWXYZ
```
Where you can more or less just extend it as far as you want
(EDIT I messed up my directives but the theory should hold) (more) |
— | over 2 years ago |
| Edit | Post #286394 |
Post edited: |
— | over 2 years ago |
| Edit | Post #286533 | Initial revision | — | over 2 years ago |
| Question | — |
From the smallest seed Challenge It's a bootstrapping challenge this time! Write a full program that, once run, writes the source code of another program that in turn, once run, writes the source code for another program, ad infinitum. However, you can't just do a quine. The length of each program must tend toward in... (more) |
— | over 2 years ago |
| Comment | Post #286369 |
```c
f(i){return i>1?f(i%2?3*i+1:i/2)+1:0;}
```
- Returning is cheaper than an accumulator
- Conditioning on not equal (in this case, >) saves one byte (more) |
— | over 2 years ago |
| Comment | Post #286394 |
I mean, you can say that about any infinite challenge. I suppose though that I could also require a proof that the programs solve the challenge. (more) |
— | over 2 years ago |
| Edit | Post #286394 |
Post edited: |
— | over 2 years ago |
| Comment | Post #286394 |
> Does that mean using only the code section of some try-it-online tool?
I don't really get what you mean by this. I was under the impression that anything runnable without needing to add anything counted as a full program.
> Does that mean generting an executable/script file? Or only printing ... (more) |
— | over 2 years ago |
| Edit | Post #286394 | Initial revision | — | over 2 years ago |
| Article | — |
From the smallest seed Challenge It's a bootstrapping challenge this time! Write a full program that, once run, writes the source code of another program that in turn, once run, writes the source code for another program, ad infinitum. However, you can't just do a quine. The length of each program must tend toward in... (more) |
— | over 2 years ago |
| Comment | Post #286370 |
```lua
function(x)return x==1 and 0 or 1+f(({x/2,3*x+1})[x%2+1])end
```
\- Directly returning the result is cheaper than passing an accumulator
\- Indexing into an array is cheaper than an `and or` (more) |
— | over 2 years ago |