Activity for celtschk
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Comment | Post #279854 |
Your depth is called rank (see [here](https://math.stackexchange.com/a/458305/34930)). Note that the definition you give only works for finite sets, as in infinite sets there may not be a maximum, see the link for a definition that always works. Also, what you call “finite” is properly called heredit... (more) |
— | over 3 years ago |
| Edit | Post #279820 | Post edited | — | over 3 years ago |
| Suggested Edit | Post #279820 |
Suggested edit: This is not kolmogorov-complexity, as it takes input (more) |
helpful | over 3 years ago |
| Comment | Post #279722 |
This is not kolmogorov-complexity, as it takes input. (more) |
— | over 3 years ago |
| Comment | Post #279791 |
An explanation would be nice. (more) |
— | over 3 years ago |
| Edit | Post #279790 | Initial revision | — | over 3 years ago |
| Question | — |
Generate Lewis Caroll's Jabberwocky The task is to generate the text of Lewis Caroll's Jabberwocky. The text, quoted from Wikipedia, is as follows (I've replaced a non-ASCII character with ASCII, otherwise it's direct copy&paste from the linked Wikipedia article): ``` 'Twas brillig, and the slithy toves Did gyre and gimble in t... (more) |
— | over 3 years ago |
| Edit | Post #279666 |
Post edited: |
— | over 3 years ago |
| Comment | Post #279253 |
@Razetime: You should probably add that as a test case, as several currently posted solutions fail in this case. (more) |
— | over 3 years ago |
| Edit | Post #279706 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Length of a Sumac Sequence [C (gcc)], 32 bytes f(a,b){return a>0?f(b,a-b)+1:0;} Try it online! (more) |
— | over 3 years ago |
| Comment | Post #279253 |
What should be the result for t1=t2=0? (more) |
— | over 3 years ago |
| Edit | Post #279666 | Initial revision | — | over 3 years ago |
| Article | — |
Generate Lewis Caroll's Jabberwocky [FINALIZED] The task is to generate the text of Lewis Caroll's Jabberwocky. The text, quoted from Wikipedia, is as follows (I've replaced a non-ASCII character with ASCII, otherwise it's direct copy&paste from the linked Wikipedia article): ``` 'Twas brillig, and the slithy toves Did gyre and gimble in t... (more) |
— | over 3 years ago |
| Edit | Post #279629 |
Post edited: I forgot to replace some variable names in the ungolfed version; also improved formatting of that version slightly |
— | over 3 years ago |
| Edit | Post #279629 |
Post edited: ungolfed/commented version |
— | over 3 years ago |
| Edit | Post #279629 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Given the preorder and the inorder of a tree, output the postorder [C (gcc)], 114 bytes f(int n,intp,inti,into){if(n){intm=i,k;for(;m!=p;++m);k=m-i;f(k,p+1,i,o);f(n-k-1,p+k+1,m+1,o);(o)++=p;}} Try it online! Arguments: `n` is the length of the arrays `p` is the preorder array `i` is the inorder array `o` is a pointer to a pointer t... (more) |
— | over 3 years ago |
| Comment | Post #279425 |
You can save 7 bytes by replacing `'SIGSEGV'` with `11` (the signal number of SIGSEGV). (more) |
— | over 3 years ago |
| Comment | Post #279141 |
Is it intentional that this community is not listed on the [main page?](https://codidact.com/) (I already commented about that on the proposal post, but I guess that was the wrong place for that comment) (more) |
— | over 3 years ago |
| Edit | Post #279407 | Initial revision | — | over 3 years ago |
| Article | — |
Run-length encode a byte sequence [FINALIZED] Run-length encoding is a simple compression technique which compresses sequences of repeating identical bytes. The encoding rules for this task are as follows: Any sequence of $n$ identical bytes ($3 \leq n \leq 63$) is replaced by a byte with value `n+0xc0` followed by only one copy of that by... (more) |
— | over 3 years ago |
| Edit | Post #279383 |
Post edited: Added ungolfed version of the code with explanation in the comments |
— | over 3 years ago |
| Edit | Post #279383 | Initial revision | — | over 3 years ago |
| Answer | — |
A: 1, 2, Fizz, 4, Buzz! C (gcc), 113 Bytes ``` i;main(){while(i++ / Declare a global int variable. The golfed code omits the type because of the old implicit-int rule, which only generates a warning also in modern gcc. Also note that global variables without initializer are zero-initialized; this is sti... (more) |
— | over 3 years ago |
| Comment | Post #279365 |
I'm pretty sure U+0020 is the space, and U+000A is the newline. BTW, what *exactly* does "must not produce an error from start to finish" mean? In particular, do compiler warnings count as errors in this context? (more) |
— | over 3 years ago |