Activity for trichoplax
Type | On... | Excerpt | Status | Date |
---|---|---|---|---|
Comment | Post #287238 |
Testing a texts (more) |
— | 10 days ago |
Comment | Post #291091 |
I've edited the Test cases section to clarify this flexibility. (more) |
— | 10 days ago |
Edit | Post #291048 |
Post edited: Clarify that "VALID" in the test outputs is not the only permitted value |
— | 10 days 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) |
— | 10 days ago |
Edit | Post #289542 |
Post edited: Correct output section |
— | 17 days ago |
Edit | Post #291002 |
Post edited: Mark as finalized |
— | 17 days ago |
Edit | Post #291048 | Initial revision | — | 17 days 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) |
— | 17 days ago |
Edit | Post #291002 |
Post edited: Clarify output |
— | 17 days ago |
Edit | Post #291002 |
Post edited: Clarify reason for maximum representable value of 3999 |
— | 17 days ago |
Edit | Post #291002 |
Post edited: Condense power of 10 columns into a single table |
— | 17 days ago |
Edit | Post #291002 |
Post edited: Add footnote linking to Standard form on Wikipedia |
— | 17 days ago |
Edit | Post #291002 |
Post edited: Add test cases with various numbers of invalid substrings |
— | 17 days 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) |
— | 21 days ago |
Edit | Post #291002 |
Post edited: Tidying |
— | 22 days ago |
Edit | Post #291002 |
Post edited: Change output requirements to require use of the 50 strings |
— | 22 days 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) |
— | 22 days 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) |
— | 22 days ago |
Edit | Post #291002 |
Post edited: Rearrange wording of valid Roman numerals section for clarity |
— | 22 days ago |
Edit | Post #291002 |
Post edited: Include all examples in the test cases |
— | 23 days ago |
Edit | Post #291002 |
Post edited: Clarify input section |
— | 23 days ago |
Edit | Post #291002 |
Post edited: Specify V, L, and D appear only once |
— | 23 days ago |
Edit | Post #291002 |
Post edited: Make the 2 methods into bullet points |
— | 23 days ago |
Edit | Post #291002 |
Post edited: Punctuate long sentence |
— | 23 days ago |
Edit | Post #291002 |
Post edited: Add clarification of construction example and maximum value |
— | 23 days ago |
Edit | Post #291002 |
Post edited: Make title more accurate |
— | 23 days ago |
Edit | Post #291002 |
Post edited: Express interest in which approach is competitive in each language |
— | 23 days ago |
Edit | Post #291002 |
Post edited: Improve wording of output section |
— | 23 days ago |
Edit | Post #291002 |
Post edited: Mention reason for upper limit on input length |
— | 23 days ago |
Edit | Post #291002 |
Post edited: Be more specific about substrings method |
— | 23 days ago |
Edit | Post #291002 | Initial revision | — | 23 days 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) |
— | 23 days ago |
Edit | Post #290978 | Initial revision | — | 25 days 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) |
— | 25 days ago |
Edit | Post #290852 |
Post edited: Add finalized to title |
— | about 1 month ago |
Edit | Post #290852 |
Post edited: Mark as finalized |
— | about 1 month ago |
Edit | Post #290870 | Initial revision | — | about 1 month 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. Output - The Nth number in the list of Fibonacci numbers whose base 10 (decimal) representation has no adjacent digits that are consecutive. - The Fibonacci numbers start w... (more) |
— | about 1 month ago |
Edit | Post #290852 |
Post edited: Specify zero indexed and add an example |
— | about 1 month ago |
Edit | Post #290852 |
Post edited: Add link and explanation of Fibonacci numbers |
— | about 1 month ago |
Edit | Post #290852 | Initial revision | — | about 1 month ago |
Article | — |
Fibonacci numbers with no consecutive digits [FINALIZED] Now posted: Fibonacci without consecutive digits Output the Nth number in the list of Fibonacci numbers that have no consecutive digits. Input - A non-negative integer. Output - The Nth number in the list of Fibonacci numbers whose base 10 (decimal) representation has no adjacent digit... (more) |
— | about 1 month ago |
Edit | Post #290667 |
Post edited: Reinstate the changes from the previous 2 edits that my edit accidentally removed |
— | about 2 months ago |
Suggested Edit | Post #290667 |
Suggested edit: Reinstate the changes from the previous 2 edits that my edit accidentally removed (more) |
helpful | about 2 months ago |
Edit | Post #290667 |
Post edited: Reduce ambiguity and typos, and add links |
— | about 2 months ago |
Edit | Post #290612 |
Post edited: Fix my mistake in the link to the posted challenge |
— | about 2 months ago |
Suggested Edit | Post #290612 |
Suggested edit: Fix my mistake in the link to the posted challenge (more) |
helpful | about 2 months ago |
Suggested Edit | Post #290667 |
Suggested edit: Reduce ambiguity and typos, and add links (more) |
helpful | about 2 months ago |
Edit | Post #290612 |
Post edited: Mark as finalized |
— | about 2 months ago |
Suggested Edit | Post #290612 |
Suggested edit: Mark as finalized (more) |
helpful | about 2 months ago |