Activity for trichoplax
Type | On... | Excerpt | Status | Date |
---|---|---|---|---|
Edit | Post #290852 |
Post edited: Specify zero indexed and add an example |
— | 9 months ago |
Edit | Post #290852 |
Post edited: Add link and explanation of Fibonacci numbers |
— | 9 months ago |
Edit | Post #290852 | Initial revision | — | 9 months 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) |
— | 9 months ago |
Edit | Post #290667 |
Post edited: Reinstate the changes from the previous 2 edits that my edit accidentally removed |
— | 10 months ago |
Suggested Edit | Post #290667 |
Suggested edit: Reinstate the changes from the previous 2 edits that my edit accidentally removed (more) |
helpful | 10 months ago |
Edit | Post #290667 |
Post edited: Reduce ambiguity and typos, and add links |
— | 10 months ago |
Edit | Post #290612 |
Post edited: Fix my mistake in the link to the posted challenge |
— | 10 months ago |
Suggested Edit | Post #290612 |
Suggested edit: Fix my mistake in the link to the posted challenge (more) |
helpful | 10 months ago |
Suggested Edit | Post #290667 |
Suggested edit: Reduce ambiguity and typos, and add links (more) |
helpful | 10 months ago |
Edit | Post #290612 |
Post edited: Mark as finalized |
— | 10 months ago |
Suggested Edit | Post #290612 |
Suggested edit: Mark as finalized (more) |
helpful | 10 months ago |
Comment | Post #290667 |
I find this much more clear. Potential improvements:
- The explanation section at the end could be broken up with subheadings or a numbered list.
- The heading "Explanation" might be better changed to something that makes immediately clear that this section is optional. Perhaps "Background" or "R... (more) |
— | 10 months ago |
Comment | Post #290667 |
This appears to be an interesting challenge, wrapped up in an interesting but unnecessary concept. The challenge would work without the concept, and be understood by more people.
For this reason, my personal preference would be to have the simple statement of the problem at the start of the challe... (more) |
— | 10 months ago |
Comment | Post #290615 |
Yes, this is a valid solution - it meets all the challenge requirements.
No need for HTML specification compliance here... (more) |
— | 10 months ago |
Comment | Post #290590 |
Nice solution. 31 bytes is much better than I was expecting for the first answer.
> The best solution is frequently the easiest one.
Does this mean you believe 31 to be optimal? I suspect 30 is possible... (more) |
— | 10 months ago |
Edit | Post #290589 | Initial revision | — | 10 months ago |
Question | — |
Plain black webpage This is a language specific challenge, for HTML only. Your answer is the content of a self contained HTML file, that when opened in a web browser gives a plain black page. Requirements - The HTML file is self contained. You may use CSS, JS, WASM, or images only if they are contained within ... (more) |
— | 10 months ago |
Edit | Post #290437 |
Post edited: Typo |
— | 11 months ago |
Suggested Edit | Post #290437 |
Suggested edit: Typo (more) |
helpful | 11 months ago |
Comment | Post #290200 |
I believe convention is to include any imports in the total length of the code. I couldn't find a Meta post specifically about this, but it is mentioned in an answer to another Meta post:
- [Default Rules: Libraries](https://codegolf.codidact.com/posts/282802/282803#answer-282803)
> However, yo... (more) |
— | about 1 year ago |
Edit | Post #290169 |
Post edited: Typo |
— | about 1 year ago |
Suggested Edit | Post #290169 |
Suggested edit: Typo (more) |
helpful | about 1 year ago |
Comment | Post #287238 |
When you say "test program" do you mean a program to test answers, or an example implementation? (more) |
— | about 1 year ago |
Comment | Post #287238 |
I try to post a range of golf challenges, because some people want a very simple challenge that they can tackle quickly on a short break, while other people enjoy a more complex challenge. I expect some people prefer different levels of complexity at different times.
I acknowledge that this is not... (more) |
— | about 1 year ago |
Edit | Post #287238 |
Post edited: Add extra consideration about negative offsets to Sandbox questions |
— | about 1 year ago |
Edit | Post #287238 |
Post edited: Consider whether to limit offsets to less than grid width and height. |
— | about 1 year ago |
Comment | Post #290106 |
I see what you mean. I tried the `map` without the parentheses and it fails, and I tried omitting the `map` and just applying to a single argument `'I'` and again it only works with the parentheses. Sorry for the false hope... (more) |
— | about 1 year ago |
Edit | Post #287238 |
Post edited: Format terminology section for clarity |
— | about 1 year ago |
Edit | Post #287238 |
Post edited: Be explicit about restricting offsets to be coprime |
— | about 1 year ago |
Comment | Post #290106 |
I don't know Haskell, but I tested your latest code using the following:
```haskell
main = do
let result = map(\n->(scanl(*)1$cycle[5,2])!!(length$takeWhile(/=n)"IVXLCDM")) ['I', 'V', 'X', 'L', 'C', 'D', 'M']
print result
```
This gives the correct results for all inputs:
```text... (more) |
— | about 1 year ago |
Comment | Post #290104 |
To summarise the difference between `def` and `lambda` in Python, the following give equivalent results:
```python
def double(n):
return n * 2
```
```python
double = lambda n: n * 2
``` (more) |
— | about 1 year ago |
Comment | Post #290104 |
```python
def f(n):i="IVXLCDM".index(n);return(4*(i%2==1)+1)*10**(i//2)
```
This can be tested as follows:
```python
def f(n):i="IVXLCDM".index(n);return(4*(i%2==1)+1)*10**(i//2)
for c in "IVXLCDM":
print(c, f(c))
``` (more) |
— | about 1 year ago |
Comment | Post #290104 |
```python
lambda n:(4*("IVXLCDM".index(n)%2==1)+1)*10**("IVXLCDM".index(n)//2)
```
This can be tested as follows:
```python
f=lambda n:(4*("IVXLCDM".index(n)%2==1)+1)*10**("IVXLCDM".index(n)//2)
for c in "IVXLCDM":
print(c, f(c))
``` (more) |
— | about 1 year ago |
Comment | Post #290104 |
I haven't tested the Haskell code, but there's a problem with the Python code that I'll explain below.
In Python, a lambda function cannot have multiple statements. If you try to run the current code, it will give an error. I can think of 2 different approaches to avoid this problem:
- Use a `lam... (more) |
— | about 1 year ago |
Comment | Post #290106 |
The same applies to this answer as I [mentioned on your Python answer](https://codegolf.codidact.com/comments/thread/8720#comment-22430). It just needs an input method to make it valid. (more) |
— | about 1 year ago |
Comment | Post #290104 |
Welcome to Code Golf Codidact!
We have a guide to acceptable input and output methods on Meta, and this currently only specifies that [input may be taken by direct insertion into the source code for languages that have no other option](https://codegolf.codidact.com/posts/282784/282794#answer-28279... (more) |
— | about 1 year ago |
Edit | Post #289996 |
Post edited: Explicitly exclude output as a Roman numeral |
— | about 1 year ago |
Comment | Post #289996 |
Good point. I will edit to make explicit that output in Roman numerals is not acceptable.
As for choosing a text encoding where the output always equals the input, I would likely vote to agree that should be a forbidden loophole if you added it to [Code Golf - Default Rules: Loopholes](https://cod... (more) |
— | about 1 year ago |
Comment | Post #289996 |
I'm happy to stick with the [defaults for I/O](https://codegolf.codidact.com/posts/282784) unless there's some loophole I need to close.
One of the answers there mentions using a character code instead of a number, which would allow outputting 1000 as "Ϩ" (unicode codepoint U+03E8) but I'm not sur... (more) |
— | about 1 year ago |
Edit | Post #287238 |
Post edited: Consider excluding words that use the same grid position more than once |
— | about 1 year ago |
Comment | Post #290065 |
Nice challenge!
Nothing broken, but just an observation in case it wasn't intentional: I notice that the test cases match the examples, with the exception of the example "TWO BIRDS WITH TWO STONE", where the test case differs: "TWO BIRDS WITH ONE STONE".
Both still work so nothing needs changin... (more) |
— | about 1 year ago |
Comment | Post #290027 |
Same point, just smaller probabilities. Only a suggestion - it's your call. (more) |
— | about 1 year ago |
Edit | Post #290000 |
Post edited: Reduce input range to make room for formatting within the post length limit |
— | about 1 year ago |
Edit | Post #290000 |
Post edited: Emphasise key terms at the point of their introduction |
— | about 1 year ago |
Comment | Post #287403 |
I decided to go with negative and zero inputs. I restricted the input range to -72 to 72 so that no output would be more than 8 characters long, but the test cases exceeded the post length limit, so I further restricted the input range to -62 to 62. (more) |
— | about 1 year ago |
Edit | Post #287403 |
Post edited: Mark as finalized |
— | about 1 year ago |
Edit | Post #290000 | Initial revision | — | about 1 year ago |
Question | — |
Shortest representation in generalised Roman numerals Find the shortest representation of an integer in generalised Roman numerals. Since there is more than one way to generalise, only the following definition applies to this challenge. Definition The digits used are the same as standard Roman numerals: Digit|Value |----: I|1 V|5 X|10 L|50 C|10... (more) |
— | about 1 year ago |
Edit | Post #287403 |
Post edited: Adjust input range for test cases excluded by post length limit |
— | about 1 year ago |