Activity for trichoplax
Type | On... | Excerpt | Status | Date |
---|---|---|---|---|
Suggested Edit | Post #291091 |
Suggested edit: Fix heading so that the leaderboard picks up the language correctly (more) |
helpful | 7 months ago |
Comment | Post #291320 |
Interesting. I understand now.
Note that the code is no longer restricted to just that one version of Python - it works in the latest version (3.12) just fine. If you change the language in the heading back to just "Python" then the leaderboard will group this answer correctly with the other Pytho... (more) |
— | 7 months ago |
Comment | Post #291320 |
No need to apologise. I don't feel that I have any obligation to test answers, I just sometimes like to out of curiosity.
I see you have since made the code even shorter. I have no idea how it works, but it does... (more) |
— | 7 months ago |
Comment | Post #291320 |
I know this isn't consistent with how semantic versioning is supposed to work, but it's my best current guess at why it doesn't work on my machine.
I suppose it's also possible there's an inconsistency between operating systems. I tested this on Linux (Fedora 39), on python 3.8.19, 3.9.19, 3.10.14... (more) |
— | 7 months ago |
Comment | Post #291320 |
It looks like there was a lot of discussion about whether to permit assignment expressions in comprehensions when they were first introduced in python 3.8. It may be that a change was made to python 3.9 after the version you are using. When I run the 222 byte version on python 3.9.19 I get an error m... (more) |
— | 7 months ago |
Comment | Post #291299 |
Would it still work if you replace
```python
range(3)
```
with
```python
0,1,2
``` (more) |
— | 7 months ago |
Edit | Post #291281 |
Post edited: Mark as finalized |
— | 7 months ago |
Edit | Post #291293 | Initial revision | — | 7 months ago |
Question | — |
Round trip stones $N$ vessels initially contain $3$ stones each. What is the probability of having at least $3$ stones in the first vessel after moving a uniformly random selection from the first vessel to the second, then from the second vessel to the third, and so on back to the first vessel? Input - A positive ... (more) |
— | 7 months ago |
Edit | Post #291281 |
Post edited: Add tag and improve grammar |
— | 7 months ago |
Edit | Post #291281 | Initial revision | — | 8 months ago |
Article | — |
Round trip stones [FINALIZED] Now posted: Round trip stones $N$ vessels initially contain $3$ stones each. What is the probability of having at least $3$ stones in the first vessel after moving a uniformly random selection from the first vessel to the second, then from the second vessel to the third, and so on back to the ... (more) |
— | 8 months ago |
Comment | Post #287238 |
Testing a texts (more) |
— | 8 months ago |
Comment | Post #291091 |
I've edited the Test cases section to clarify this flexibility. (more) |
— | 8 months ago |
Edit | Post #291048 |
Post edited: Clarify that "VALID" in the test outputs is not the only permitted value |
— | 8 months ago |
Comment | Post #291091 |
When the input is a valid Roman number, the output does not need to be specifically the string "VALID". From the first bullet point of the Output section, you just need to "output a consistent value" which "must not be one of the strings from the list of 50".
Hopefully this saves you some bytes. (more) |
— | 8 months ago |
Edit | Post #289542 |
Post edited: Correct output section |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Mark as finalized |
— | 9 months ago |
Edit | Post #291048 | Initial revision | — | 9 months ago |
Question | — |
The 50 substrings that validate any string of Roman numerals Given a string of Roman numerals, decide whether it forms a valid Roman number. If not, output the substring that proves this, from the list of 50 strings described below. Relevant fact This challenge is based around the following fact: > A string of Roman numerals is a valid Roman number if a... (more) |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Clarify output |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Clarify reason for maximum representable value of 3999 |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Condense power of 10 columns into a single table |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Add footnote linking to Standard form on Wikipedia |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Add test cases with various numbers of invalid substrings |
— | 9 months ago |
Comment | Post #291002 |
I have now edited to change the challenge to match the previous comment. Is there any problem with this? Anything to improve? (more) |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Tidying |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Change output requirements to require use of the 50 strings |
— | 9 months ago |
Comment | Post #291002 |
Another possible challenge:
Given a string of Roman numerals, output either "valid" or a string from the list of 50 that proves it invalid. This may involve the Kolmogorov complexity challenge as a subchallenge. Is this good or bad? (more) |
— | 9 months ago |
Comment | Post #291002 |
As written, the challenge is simply to validate a string of Roman numerals. I suspect that in most languages the golfiest way will be regex, and the list of 50 substrings will not be used. As such, they are irrelevant background info about Roman numerals, rather than being part of the challenge. I'm ... (more) |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Rearrange wording of valid Roman numerals section for clarity |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Include all examples in the test cases |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Clarify input section |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Specify V, L, and D appear only once |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Make the 2 methods into bullet points |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Punctuate long sentence |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Add clarification of construction example and maximum value |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Make title more accurate |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Express interest in which approach is competitive in each language |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Improve wording of output section |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Mention reason for upper limit on input length |
— | 9 months ago |
Edit | Post #291002 |
Post edited: Be more specific about substrings method |
— | 9 months ago |
Edit | Post #291002 | Initial revision | — | 9 months ago |
Article | — |
The 50 substrings that validate any string of Roman numerals [FINALIZED] Now posted: The 50 substrings that validate any string of Roman numerals Given a string of Roman numerals, decide whether it forms a valid Roman number. If not, output the substring that proves this, from the list of 50 strings described below. Relevant fact This challenge is based around ... (more) |
— | 9 months ago |
Edit | Post #290978 | Initial revision | — | 9 months ago |
Question | — |
Leaderboard sorting bug The leaderboard that shows below a code golf challenge can either sort the answers to show the winner for each language separately (if "Group by language" is ticked) or it can show all the answers from all the languages sorted as a single list, to give an overall winner. There seems to be a bug in... (more) |
— | 9 months ago |
Edit | Post #290852 |
Post edited: Add finalized to title |
— | 9 months ago |
Edit | Post #290852 |
Post edited: Mark as finalized |
— | 9 months ago |
Edit | Post #290870 | Initial revision | — | 9 months ago |
Question | — |
Fibonacci without consecutive digits Output the Nth number in the list of Fibonacci numbers that have no consecutive digits. Input - A non-negative integer (if you treat the Fibonacci numbers as zero-indexed) or a positive integer (if you treat the Fibonacci numbers as one-indexed). Output - The Nth number in the list of Fibonac... (more) |
— | 9 months ago |