Activity for moonyâ€
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Comment | Post #280785 |
Seems so, it's only different for languages where strings aren't implicitly character arrays (more) |
— | about 3 years ago |
| Edit | Post #280785 |
Post edited: |
— | about 3 years ago |
| Edit | Post #280785 | Initial revision | — | about 3 years ago |
| Article | — |
Interleave multiple arrays at once Given $ n $ lists of numbers: $$ [A1, A2, ..., Ax ] $$ $$ [B1, B2, ..., By ] $$ $$ [C1, C2, ..., Cz ] $$ Join them in a way that the index of each element is preserved. The order between elements with the same index does not matter. Sorted: $$ [A1, B1, C1, ..., Ax, By, Cz] $$ Arbitrary, ... (more) |
— | about 3 years ago |
| Comment | Post #280766 |
And on the Propeller 1, where Spin is the official language, It's interpreter is physically part of the MCU's ROM, so it's impossible to comply with that rule. (more) |
— | about 3 years ago |
| Comment | Post #280766 |
Case in point: The official language for the Propeller 2, Spin 2, provides some very simple abstractions over the hardware. This is not optional, and is a core part of the interpreter, removing this is nontrivial. (more) |
— | about 3 years ago |
| Comment | Post #280766 |
I do disagree with the "No premade HALs" rule here. It's perfectly acceptable in other challenges to say, for example, you're doing "GCC C++ w/ Boost version here", so it should be acceptable here too. Omitting libc is pretty much just it's own contending language by current rules.
Output format wil... (more) |
— | about 3 years ago |
| Edit | Post #280756 |
Post edited: |
— | about 3 years ago |
| Edit | Post #280756 | Initial revision | — | about 3 years ago |
| Question | — |
Microcontroller-involving challenges and the rules. I'd like to make a challenge that involves the use of a microcontroller, specifically, a challenge to read any 4-bit Gray Code from 4 IO pins, and convert it to binary. Simple introductory type challenge. Problem, of course, is we have no set precedents for this type of challenge. A few questio... (more) |
— | about 3 years ago |
| Comment | Post #279763 |
Raku continues to make me wonder if it's just a golf language in disguise (more) |
— | over 3 years ago |
| Edit | Post #279692 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Befunge Golfing Tips Bitwise operations (WIP) Befunge, rather pointedly, lacks bitwise ops. No shifts, no and, no or, no xor. Shifts Shifts can be implemented as multiplication and division by powers of two. Shifts by arbitrary amounts can be done with successive multiplication/division by two. Rendered tricky by n... (more) |
— | over 3 years ago |
| Edit | Post #279665 |
Post edited: oops |
— | over 3 years ago |
| Edit | Post #279665 |
Post edited: changes recommended by jo king |
— | over 3 years ago |
| Edit | Post #279665 |
Post edited: complete |
— | over 3 years ago |
| Edit | Post #279665 |
Post edited: oh lord this got big |
— | over 3 years ago |
| Edit | Post #279665 |
Post edited: big table |
— | over 3 years ago |
| Edit | Post #279665 |
Post edited: moooore |
— | over 3 years ago |
| Edit | Post #279665 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Befunge Golfing Tips Golfing numbers Numbers above 15 and below zero take more than one byte to create. Here's a table of numbers up to 100 (Not including negatives yet) Table for '98 NOTE: For numbers that are also valid ASCII characters, it can be smaller to use `" "` to insert them. This isn't included in the t... (more) |
— | over 3 years ago |
| Edit | Post #279660 | Initial revision | — | over 3 years ago |
| Question | — |
Befunge Golfing Tips Post tips for Befunge code golf here! This is based on a type of question I used to see on CGCC, where people would post tips for golfing in various languages. They happened to be quite helpful, so I thought it'd be nice to bring them back. (more) |
— | over 3 years ago |
| Comment | Post #279659 |
@Quintec it does! That's actually a very inefficient answer though. Would be smarter to try and do, say, TREE(3) iterations of an output.
Maybe take the logarithm base 10 of the output, though. (more) |
— | over 3 years ago |
| Edit | Post #279659 | Initial revision | — | over 3 years ago |
| Article | — |
Largest finite output Your goal is to output the longest finite string of data, with known length (no RNG!) Your score is $outputlen/bytecount$, competing on a per-language basis. Specify the byte count, output length in bytes, and final score in your answer's header. (more) |
— | over 3 years ago |
| Edit | Post #279640 |
Post edited: got ahead of myself |
— | over 3 years ago |
| Edit | Post #279640 |
Post edited: utilize new rules. also take advantage of the fact this is '98, and we have a shorthand for 10. |
— | over 3 years ago |
| Edit | Post #279639 |
Post edited: |
— | over 3 years ago |
| Comment | Post #279640 |
16 bytes with no newline output, `>5+#:-#~_$>:#,_@`
Make your own post, it's a more intelligent solution than mine :P (more) |
— | over 3 years ago |
| Comment | Post #279639 |
There's some artifacts from this challenge being written around an answer instead of the other way around. (more) |
— | over 3 years ago |
| Edit | Post #279639 |
Post edited: |
— | over 3 years ago |
| Comment | Post #279639 |
@Jo King Codidact has a "suggest changes" feature right? Can you please use that?
As for handling empty inputs: No. (more) |
— | over 3 years ago |
| Edit | Post #279640 |
Post edited: sooo cloooose. note: entirely unrelated to my clarification. |
— | over 3 years ago |
| Edit | Post #279639 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279640 |
Post edited: clarify that this is funge-98, though it should work in 93 still. |
— | over 3 years ago |
| Edit | Post #279640 |
Post edited: |
— | over 3 years ago |
| Edit | Post #279640 |
Post edited: flattened it like a pancake for byte savings |
— | over 3 years ago |
| Edit | Post #279640 |
Post edited: forgot to nuke two spaces |
— | over 3 years ago |
| Edit | Post #279640 |
Post edited: last minute improvements are last minute |
— | over 3 years ago |
| Edit | Post #279640 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Reverse an ASCII string Befunge-98, 45 39 37 33 29 21 bytes ``` v:a-| >v$< ,: ^@ ``` Try it online! This answer probably sucks :P (more) |
— | over 3 years ago |
| Edit | Post #279639 | Initial revision | — | over 3 years ago |
| Question | — |
Reverse an ASCII string Your goal is to reverse an ascii string. Given a (optionally newline or null terminated) input, output your input in reverse order, optionally followed by a newline. Terminate afterward. Function answers will not be given a newline, and are not expected to output one unless they print the answer to... (more) |
— | over 3 years ago |
| Edit | Post #279635 | Initial revision | — | over 3 years ago |
| Question | — |
Do we require codegolf challenges include example code? I feel it'd be a good idea to require, or at least heavily encourage, that challenges include an example, ungolfed, readable solution in a non-golf language like Javascript, C, Rust, or Python. This would augment the challenge's description with a known-working solution contestants can use as a gu... (more) |
— | over 3 years ago |
| Edit | Post #279416 |
Post edited: -15 bytes |
— | over 3 years ago |
| Edit | Post #279416 |
Post edited: there was a space... also doesn't work on TIO, only with rustc 1.0.0 sooo |
— | over 3 years ago |
| Edit | Post #279416 |
Post edited: -5 bytes |
— | over 3 years ago |
| Edit | Post #279416 | Initial revision | — | over 3 years ago |