Activity for Razetime
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Edit | Post #280753 |
Post edited: |
— | about 3 years ago |
| Edit | Post #280753 | Initial revision | — | about 3 years ago |
| Article | — |
The Pell Numbers[FINALIZED] Introduction The Pell(no, not Bell) Numbers are a simple, Fibonacci-like sequence, defined by the following relation: \$Pn=\begin{cases}0&\mbox{if }n=0;\\\\1&\mbox{if }n=1;\\\\2P{n-1}+P{n-2}&\mbox{otherwise.}\end{cases}\$ They also have a closed form: \$Pn=\frac{\left(1+\sqrt2\right)^n-\l... (more) |
— | about 3 years ago |
| Edit | Post #280751 | Initial revision | — | about 3 years ago |
| Answer | — |
A: Solve Goldbach's Conjecture [Husk], 9 bytes ḟo=⁰Σπ2İp Try it online! Explanation ``` ḟo=⁰Σπ2İp İp take the infinite list of primes π2 cartesian power 2 (all possible pairs) ḟo first pair which satisfies: Σ sum = equals ⁰ input? (more) |
— | about 3 years ago |
| Edit | Post #280730 | Initial revision | — | about 3 years ago |
| Answer | — |
A: Create an Alphabet Diamond Stax, 12 bytes ç ∩<▬%▌ê▓jFo Run and debug it Same method as the Canvas answer. (more) |
— | about 3 years ago |
| Edit | Post #280729 | Initial revision | — | about 3 years ago |
| Answer | — |
A: Create an Alphabet Diamond Canvas, 10 7 6 bytes Ｚ［］／┼┼ Try it here! Creates the top portion, centers it, and mirrors it. -3 bytes from dzaima's hint. -1, found the 6 byter! Explanation ``` Z[]/++ Z push the alphabet [] get all prefixes / diagonalize by padding each line with ... (more) |
— | about 3 years ago |
| Comment | Post #280673 |
[Obligatory Canvas answer](https://dzaima.github.io/Canvas/?u=JXVGRjNBJXVGRjNCJXUyNTAyJXVGRjNEJXVGRjUyJXUyNTAwJTVFJXUyMjE5ViV1MjU0Qg__,v=8) (more) |
— | about 3 years ago |
| Comment | Post #280646 |
You may want to add some testcases with broken lines i.e. `5 5 ⍴ 1 0 1 1 0 0` (more) |
— | over 3 years ago |
| Edit | Post #280612 |
Post edited: added new testcases |
— | over 3 years ago |
| Edit | Post #280612 |
Post edited: |
— | over 3 years ago |
| Edit | Post #280551 |
Post edited: |
— | over 3 years ago |
| Edit | Post #280612 | Initial revision | — | over 3 years ago |
| Question | — |
Write a Deadfish Interpreter A rewrite of this SE question with a simpler input format and guidelines. Challenge Deadfish uses a single accumulator, on which all commands are to be performed. It has the following commands: |Command|Description |-|- |`i`|increment the accumulator |`d`|decrement the accumulator |`s... (more) |
— | over 3 years ago |
| Comment | Post #280597 |
I was waiting for this one.. (more) |
— | over 3 years ago |
| Edit | Post #279253 |
Post edited: |
— | over 3 years ago |
| Edit | Post #280551 | Initial revision | — | over 3 years ago |
| Article | — |
Write a Deadfish Interpreter[FINALIZED] A rewrite of this question with a simpler input format and guidelines. Challenge Deadfish uses a single accumulator, on which all commands are to be performed. It has the following commands: |Command|Description |-|- |i|increment the accumulator |d|decrement the accumulator |s|square ... (more) |
— | over 3 years ago |
| Comment | Post #280408 |
Also, if this is code-golf, there's no need for an alternative scoring tag. (more) |
— | over 3 years ago |
| Comment | Post #280408 |
I mean, do unicode alphabets count as alphabetical characters or non alphabet chars? (more) |
— | over 3 years ago |
| Comment | Post #280408 |
Where do unicode alphabet characters(`ṙ,ṡ,ṫ`) fit in this? (more) |
— | over 3 years ago |
| Comment | Post #280372 |
Ok, I've changed it to take 2D arrays only. (more) |
— | over 3 years ago |
| Edit | Post #280372 |
Post edited: |
— | over 3 years ago |
| Comment | Post #280372 |
@Quintec I allowed dimensions as a separate input if needed for that reason. Would it make more sense to have 2D arrays only? (more) |
— | over 3 years ago |
| Edit | Post #280372 | Initial revision | — | over 3 years ago |
| Question | — |
Truthify an array Jelly has an atom called untruth, which when given indices, creates an array with 1s at those places: `[2,4] → [0,1,0,1]`. You are required to perform the inverse of this. Given a 2D boolean array, find the indices of the true values in it. Challenge You will be given a single 2D boolean arr... (more) |
— | over 3 years ago |
| Comment | Post #280242 |
@Lundin For more trivial tasks, yes. (more) |
— | over 3 years ago |
| Edit | Post #280083 |
Post edited: |
— | over 3 years ago |
| Edit | Post #280242 | Initial revision | — | over 3 years ago |
| Question | — |
Posting guidelines modifications Currently, the posting guidelines for Code Golf are the defaults on Codidact. Posting Tips: ¶ Your title should be a one sentence summary of your question. ¶ Break different topics up into paragraphs. Multiple paragraphs are easier to read than a wall of text. ¶ Use clear, simple language. Be spec... (more) |
— | over 3 years ago |
| Comment | Post #280226 |
@Corsaka You must specify the input format. The testcases are formatted that way for readability. (more) |
— | over 3 years ago |
| Edit | Post #280226 | Initial revision | — | over 3 years ago |
| Question | — |
Calculate a person's age Challenge Given a date with day, month and year, calculate how old a person born on that day would be today. Input can be in any reasonable format(params, array, date object). Input will never be invalid. Output must consist of years, months and days in any order you specify. Date and Ti... (more) |
— | over 3 years ago |
| Comment | Post #280096 |
Very clean answer. I love it! (more) |
— | over 3 years ago |
| Edit | Post #280092 | Initial revision | — | over 3 years ago |
| Question | — |
Golf me a polygonal loader CGCC Sandbox, Codidact Sandbox Given three positive integers as input, animate an ascii-art polygonal loading symbol on the screen. Intro Using the first input \$n\$, Take one the following regular polygons: ``` ... (more) |
— | over 3 years ago |
| Edit | Post #280083 | Initial revision | — | over 3 years ago |
| Answer | — |
A: The Camelot Wheel [APL (Dyalog Unicode)], 110 67 bytes {(⍕((f⊖⍪'AEBFCGDAEBFD'),r⌽12↑¯6↑5⍴'-')⍳2↑⍵),⎕a⌷⍨1+0≠f←¯3+r←3×'i'∊⍵} -43 bytes from dzaima. Requires input exactly as shown in the diagram. A bit fiddly with the compression, but works correctly. In both circles, the notes come in the form `A... (more) |
— | over 3 years ago |
| Comment | Post #279883 |
Is the final output supposed to look like a christmas tree or not?
(more) |
— | over 3 years ago |
| Comment | Post #279854 |
The problem with adding things in to be figured out is that once one person figures it out, everyone else just copies them. Hence, it's generally encouraged to have a full description of what you expect the programmer to do. (more) |
— | over 3 years ago |
| Comment | Post #279854 |
There must be some sort of recursive definition for this.. (more) |
— | over 3 years ago |
| Comment | Post #279855 |
The example in your tio link is majestic. Nice answer. (more) |
— | over 3 years ago |
| Comment | Post #279852 |
This is suprisingly hard to compress well. (more) |
— | over 3 years ago |
| Comment | Post #279778 |
Yes, correct. I've also modified the question from the suggestions on SE. (more) |
— | over 3 years ago |
| Edit | Post #279778 |
Post edited: |
— | over 3 years ago |
| Comment | Post #279791 |
Basically, it is the most boring(and oftentimes most efficient) kolmogorov complexity language.
(more) |
— | over 3 years ago |
| Comment | Post #279791 |
@celtschk Bubblegum is used to provide constant output, generally from SHA-256, LZMA or TAR compressed files. This answer is probably a valid SHA256 hash. Read [here](https://esolangs.org/wiki/Bubblegum) (more) |
— | over 3 years ago |
| Edit | Post #279778 |
Post edited: |
— | over 3 years ago |