Activity for dzaima
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Answer | — |
A: Default Rules: Extensions The answer header must specify the minimum implementation & environment required If there are multiple implementations of a language and an answer depends on features of one, it must be specified. Otherwise, it can just specify the language. That specification can be done mostly in any form, as... (more) |
— | over 2 years ago |
| Answer | — |
A: Diagonalized alphabet Canvas, 17 11 bytes Ｚ２ｎ⤢Ｊ｛×７«ｍＴ Try it here! ```text Z The alphabet 2n split into pairs: ["AB","CD","EF",…] ⤢ transposed: ["ACEGI…","BDFHJ…"] J remove and push the first item: ["BDFHJ…"], "ACEGI…" { for each character of "ACEGI…" ... (more) |
— | almost 3 years ago |
| Answer | — |
A: Cumulative Counts BQN, 5 bytes ``` 1+⊒ ``` Try it here! 3 characters, but, as there's no SBCS codepage for BQN, it must be counted as UTF-8. Two of the three characters are just adding one to the built-in that almost solves the challenge too. (more) |
— | about 3 years ago |
| Question | — |
Create an Alphabet Diamond Challenge Output the following text: ```text A ABA ABCBA ABCDCBA ABCDEDCBA ABCDEFEDCBA ABCDEFGFEDCBA ABCDEFGHGFEDCBA ... (more) |
— | about 3 years ago |
| Article | — |
Create an Alphabet Diamond [FINALIZED] Challenge Output the following text: ```text A ABA ABCBA ABCDCBA ABCDEDCBA ABCDEFEDCBA ABCDEFGFEDCBA ABCDEFGHGFEDCBA ... (more) |
— | about 3 years ago |
| Article | — |
Draw a line over ASCII Challenge Given a multiline string, list of lines, a character matrix or equivalent, and a description of a line, draw a line made out of either `'|'` or `'-'` over it. The given text will consist of characters `" -|+"`. A `'-'` drawn over `'|'` or vice versa makes a `'+'`, and drawing over a `... (more) |
— | over 3 years ago |
| Question | — |
Output 256 in many different ways Challenge Write as many functions, programs, or snippets of code, that result in 256. Your score is the number of separate solutions submitted in an answer. The challenge? The characters used in one solution must not appear in any other solution. That is, there is no character used in more than... (more) |
— | over 3 years ago |
| Answer | — |
A: Do we require codegolf challenges include example code? Don't require example code In general, I believe the decision should be on the challenge creator. Requiring it would be useless for certain types of challenges (kolmogorov-complexity or similar), and boilerplate on simple ones. Furthermore, such an example solution couldn't showcase all options... (more) |
— | over 3 years ago |
| Article | — |
Output 256 in many different ways [FINALIZED] Challenge Write as many functions, programs, or snippets of code, that result in 256. Your score is the number of separate solutions submitted in an answer. The challenge? The characters used in one solution must not appear in any other solution. That is, there is no character used in more than... (more) |
— | over 3 years ago |
| Answer | — |
A: 1, 2, Fizz, 4, Buzz! Canvas, 24 bytes zz＋¹┘％！＊ ‾U｛ŗ３Fi⁸５Bu⁸＋ｎＯ Try it here! Explanation (ASCII-fied for better monospacing): ```text zz+¹┘%! Helper function ⁸; Expects stack to be [modulo, string] zz+ append "zz" to the string ¹ push the current loop index ┘ retrieve the modu... (more) |
— | over 3 years ago |
| Question | — |
How do we handle standardizing things? Code golf, being about exploiting things, often brings about many questions about edge cases. Since we don't want each challenge to have to deal with all problems again and again, it makes sense to standardize some defaults for questions about various topics (including, but definitely not limited to,... (more) |
— | over 3 years ago |
| Answer | — |
A: What are the rules of programming language compliance? If there exists something (reasonable) that can run it, it's valid. This includes obscure, non-standards-compliant compilers (though this should be specified in the answer if needed). So any posted program on a standard code-golf question must actually be executable and should (at least theoretica... (more) |
— | over 3 years ago |
| Answer | — |
A: Print the Great Numeric Pyramid Canvas, 19 bytes ‾－｛｛╷¹²－ｍ‾－¹－ｍ］ ＊］／ Try it here! ```text ‾-{{╷¹²-m‾-¹-m] ]/ Program, ascii-fied for monospacing ‾- push 28 { ] for 1…28 (pushing counter & saving in ¹): { ] for 1…counter (pushing counter & saving in ²): ╷ ... (more) |
— | over 3 years ago |
| Answer | — |
A: Prime Difference [Dyalog APL Extended], 14 bytes ```apl {¯4⍭4⍭⍣(⍵≤-)2} ``` Try it online! ```apl {¯4⍭4⍭⍣(⍵≤-)2} Monadic dfn 2 start with 2 ⍣ Repeat 4⍭ the function "next prime" (⍵≤-) until the difference from the previous one is ≥ the input ¯4⍭ ... (more) |
— | over 3 years ago |
| Answer | — |
A: "Hello, World!" SOGL, 10 bytes ╥‰⅜,(ε ‘ū Try it here! Built-in compression of `"hello"; ", "; "world"; "!"`, with first letters of words uppercased. (more) |
— | over 3 years ago |