Timeline for Repeated! Factorials!
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 18, 2022 at 3:10 | comment | added | Unrelated String | RUmP is a more direct ASCII-only version as well. | |
| Aug 7, 2019 at 13:43 | history | edited | Mr. Xcoder | CC BY-SA 4.0 | added 66 characters in body |
| Aug 7, 2019 at 13:42 | comment | added | Kye W Shi | @Mr.Xcoder Oh, I see! Thanks. | |
| Aug 7, 2019 at 13:41 | comment | added | Mr. Xcoder | @KyeWShi Jelly has its own codepage, so each of the 256 characters it contains is encoded as 1 byte. | |
| Aug 7, 2019 at 13:40 | comment | added | Kye W Shi | Isn't the Ṛ itself 3 bytes (\xe1\xb9\x9a), making this 6 bytes total? (Or, I'm new to code golf, and "byte" here means one unicode character...). | |
| Aug 5, 2019 at 18:07 | comment | added | Erik the Outgolfer | Alternative that looks like CJam: r1mP. | |
| Aug 5, 2019 at 14:58 | comment | added | V. Courtois | Hah thank you very much. One day I might want to golf in this language so I'll have to learn those monads, dyads etc. | |
| Aug 5, 2019 at 14:39 | history | edited | Mr. Xcoder | CC BY-SA 4.0 | added 254 characters in body |
| Aug 5, 2019 at 14:38 | comment | added | Mr. Xcoder | @V.Courtois Given \$n\$ and \$k\$, it first generates the range \$n,\cdots, 1\$ (with RṚ), then with m it keeps every \$k^{\text{th}}\$ element of this range (so \$n, n-k, n-2k,\cdots,n-\lfloor n/k\rfloor k\$), and finally multiplies them using P. Just the straightforward approach. Edit: I added this explanation in the answer. | |
| Aug 5, 2019 at 14:20 | comment | added | V. Courtois | Works well, and so simple in the end. I don't know Jelly at all but at least it looks good :) | |
| Aug 5, 2019 at 7:55 | history | answered | Mr. Xcoder | CC BY-SA 4.0 |