Activity for trichoplax
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Comment | Post #291542 |
Since this uses the same regex as your JavaScript answer, the same bug applies as described in [Peter Taylor's comment there](https://codegolf.codidact.com/comments/thread/9801#comment-24662). (more) |
— | about 1 hour ago |
| Edit | Post #291048 |
Post edited: Fix wording of lower case test cases introduction |
— | about 1 hour ago |
| Comment | Post #291048 |
I hadn't thought of that. I see no reason why not. I've now edited to explicitly allow lower case, provided that your output is in the same case as your input (apart from the indication that an input is valid, which can be any consistent value), and I've added the same test cases in lower case. (more) |
— | about 1 hour ago |
| Edit | Post #291048 |
Post edited: Fine tune lower case requirements |
— | about 1 hour ago |
| Edit | Post #291048 |
Post edited: Allow lower case input and add lower case test cases |
— | about 2 hours ago |
| Comment | Post #292741 |
Yes there is more than 1 way to get the correct answer. I'm interested to see which way will turn out to be shortest in different languages. (more) |
— | 5 days ago |
| Edit | Post #292696 |
Post edited: Mark as finalized |
— | 5 days ago |
| Edit | Post #292741 | Initial revision | — | 5 days ago |
| Question | — |
Multiplicative perfection Given a positive integer, indicate whether it is the product of its proper divisors. Integers equal to the product of their proper divisors can be found on the Online Encyclopedia of Integer Sequences as the Multiplicatively perfect numbers. Input - A positive integer N. Output - An indica... (more) |
— | 5 days ago |
| Comment | Post #292696 |
Thanks for the feedback. I should have noticed that when I found the OEIS entry. I've replaced all occurrences now. (more) |
— | 7 days ago |
| Edit | Post #292696 |
Post edited: Improve terminology following Sandbox feedback, and put examples in a table |
— | 7 days ago |
| Edit | Post #292696 |
Post edited: Wording refinement |
— | 8 days ago |
| Edit | Post #292696 | Initial revision | — | 11 days ago |
| Article | — |
Multiplicative perfection [FINALIZED] Now posts: Multiplicative perfection Given a positive integer, indicate whether it is the product of its proper divisors. Integers equal to the product of their proper divisors can be found on the Online Encyclopedia of Integer Sequences as the Multiplicatively perfect numbers. Input - ... (more) |
— | 11 days ago |
| Edit | Post #292658 | Initial revision | — | 17 days ago |
| Answer | — |
A: Preferred length limit for Code Golf posts 65,535 The database field can already handle up to 65,535 (216 - 1) characters. Same for all post types and categories I don't see a need for different limits for questions and answers, or for different categories. Challenges I sometimes find the current 30,000 character limit restrictive,... (more) |
— | 17 days ago |
| Edit | Post #292657 | Initial revision | — | 17 days ago |
| Question | — |
Preferred length limit for Code Golf posts Currently the maximum number of characters for a Codidact post is 30,000. However, at some point this may be configurable per community (or perhaps per category). There is a GitHub issue for Configurable length limits for content. If this configuration option is implemented, what limit would you l... (more) |
— | 17 days ago |
| Comment | Post #292376 |
Good point about combining with a library. That seems to make this inclusive of more languages. (more) |
— | about 1 month ago |
| Comment | Post #292376 |
Personally, I expected that "constants" would be referring to the names of built in constants, such as `PI` or `SQRT3`.
However, since the names of such constants also count as "identifiers", it might help to have an explanation of each term to remove ambiguity. (more) |
— | about 1 month ago |
| Comment | Post #292376 |
Another possible wording:
> The English alphabet (in alphabetical order) is a subsequence of the source code. (more) |
— | about 1 month ago |
| Comment | Post #292376 |
> the source itself contains and iterates through the whole English alphabet
Here "iterates through" sounds like the code when running has to process the alphabet, which does not appear to be the case from the example code. My best guess at the intended meaning is:
> the source itself contains ... (more) |
— | about 1 month ago |
| Comment | Post #292376 |
I don't know if there are languages for which not every letter is included in a language keyword, function name, constant, or identifier. If there are, then it sounds like these languages would be unable to compete. I have 2 thoughts on this:
1. Not every challenge has to be open to every language. ... (more) |
— | about 1 month ago |
| Comment | Post #292356 |
In response to a comment on the challenge, I've decided to make the input format more flexible. This leaves your current answer just as valid as before, but I'm letting you know because it is likely you can use the added flexibility to reduce your score. (more) |
— | about 2 months ago |
| Comment | Post #292354 |
I've now edited to make the input format more flexible.
Specifically, yes you can take input as an array of digits. (more) |
— | about 2 months ago |
| Edit | Post #292354 |
Post edited: Make input format more flexible |
— | about 2 months ago |
| Comment | Post #292354 |
Allowing an array of digits (as integers rather than characters) would bring the python answer down to 27 bytes.
I did intend this as a very quick challenge, so I'm now considering allowing input as any of:
- a number (such as integer or floating point number)
- a string
- an array of character... (more) |
— | about 2 months ago |
| Comment | Post #292354 |
Actually allowing input as a string would only take the python answer from 37 bytes to 32, so I was probably overstating "bulk of the challenge". (more) |
— | about 2 months ago |
| Comment | Post #292354 |
Oh good point. I hadn't thought of that. Usually I like input formats to be flexible as long as the input format doesn't constitute preprocessing. In this case I feel like separating the input into digits is the bulk of the challenge.
I've currently specified input as an integer, so the existing p... (more) |
— | about 2 months ago |
| Edit | Post #292355 |
Post edited: Clarify |
— | about 2 months ago |
| Edit | Post #292355 |
Post edited: Remove redundant "non-empty" |
— | about 2 months ago |
| Edit | Post #292355 | Initial revision | — | about 2 months ago |
| Article | — |
Digits with subsets of unique probability Output a random digit, with no 2 subsets having equal probability. Input There is no input for this challenge. Output - A single digit from 0 to 9. - The output must have a distinct probability of being in each subset of the digits 0 to 9. - It follows that every digit must have a non-zero ... (more) |
— | about 2 months ago |
| Edit | Post #292344 |
Post edited: Mark as finalized |
— | about 2 months ago |
| Edit | Post #292354 | Initial revision | — | about 2 months ago |
| Question | — |
How many odd digits? Given a positive integer, count its odd digits. Input - An integer from 1 to 999,999,999, inclusive, in any of the following formats: - A number (such as an integer or floating point number), like `123`. - A string, like `"123"`. - A sequence of characters (such as an array or list), lik... (more) |
— | about 2 months ago |
| Edit | Post #292350 |
Post edited: Change footnote to 3 to avoid clash with 1 and 2 in another answer on this page |
— | about 2 months ago |
| Edit | Post #292350 |
Post edited: Link to main function answer |
— | about 2 months ago |
| Edit | Post #292347 |
Post edited: Condense |
— | about 2 months ago |
| Comment | Post #292351 |
This answer is the one I am least confident of. It isn't clear what counts as a "snippet" of code, making it difficult to know how to interpret this answer. I've added this answer as a starting point for discussion. Please mention any exceptions or edge cases. (more) |
— | about 2 months ago |
| Edit | Post #292351 |
Post edited: Mention STDIN |
— | about 2 months ago |
| Edit | Post #292351 | Initial revision | — | about 2 months ago |
| Answer | — |
A: Default Rules: Code Golf Answer Types A snippet is not a valid answer A code golf answer must in general be able to take input[^1] and give output. A snippet of code that is not contained in a function or program cannot take input[^2], instead requiring the input value to be inserted directly into the code. This is not an acceptable typ... (more) |
— | about 2 months ago |
| Edit | Post #292350 | Initial revision | — | about 2 months ago |
| Answer | — |
A: Default Rules: Code Golf Answer Types Anonymous function A code golf answer can be an anonymous function[^3]. That is, a function that can be defined without giving it a name (in programming languages that allow this). If an anonymous function does not call itself, it need not be given a name. If an anonymous function is recursive, i... (more) |
— | about 2 months ago |
| Edit | Post #292349 |
Post edited: List full import code to remove ambiguity |
— | about 2 months ago |
| Edit | Post #292349 | Initial revision | — | about 2 months ago |
| Answer | — |
A: Default Rules: Code Golf Answer Types Function Score is the bytes of the function A code golf answer can be a function. Only the bytes required to define the function are included in the score. Score includes imports and definitions If the function depends on additional source code in order to work, the bytes required for that addi... (more) |
— | about 2 months ago |
| Edit | Post #292348 | Initial revision | — | about 2 months ago |
| Answer | — |
A: Default Rules: Code Golf Answer Types Complete program A code golf answer can be a complete program. This means that the code can be interpreted or compiled (as appropriate) without any additional source code. (more) |
— | about 2 months ago |