Activity for Razetime
Type | On... | Excerpt | Status | Date |
---|---|---|---|---|
Answer | — |
A: Make my number a set [JavaScript (V8)], 32 bytes f=n=>[...Array(n).keys()].map(f) Try it online! Somehow it doesn't recurse forever at n=0. Pretty nice. (more) |
— | over 3 years ago |
Comment | Post #281501 |
doesn't Jelly smash print, removing the need for `F`? (more) |
— | over 3 years ago |
Edit | Post #281467 |
Post edited: |
— | over 3 years ago |
Comment | Post #281467 |
whoops sorry bout that (more) |
— | over 3 years ago |
Edit | Post #281467 | Initial revision | — | over 3 years ago |
Answer | — |
A: Really Cool Numbers [Husk], 9 bytes ΛöS=⌊AhḊḊ Try it online! or Verify all testcases returns number of divisors + 1 for true and 0 for false. (more) |
— | over 3 years ago |
Comment | Post #281460 |
[-1](https://tio.run/##SyzI0U2pTMzJT///qG@qp/@jtgkG/9OAZPWjjuX6Gga2hjXa@oe3P@pcpHloheGjtsmHVqQfWqGRDlTxqGPVo65FjzpWPOrdrPmod2vt//9pQDUKRgqmCmYKlgpGpgpGBuZcQDFjAyDLDIgtAA "APL (Dyalog Unicode) – Try It Online") simplifying the inner function. You can also get -2 by converting to a tradfn, since ⍵ is u... (more) |
— | over 3 years ago |
Comment | Post #281389 |
Using Jelly idea: [29 bytes](https://razetime.github.io/APLgolf/?h=AwA&c=qzayK37UNuFRT4fR4e2Pelc86lz0qHerFRA/6m7RedTb@aht4qOO9kMrijWALKDA0kddTY/aJmsCVdQCAA&f=S1NQdw6JDPIPUOdKU1B39Y90DvHzCwjyBHODQv1d/dyCXR3dfINcPELUAQ&i=S1NQdw6JDPIPUOdKU1B39Y90DvHzCwjyBHODQv1d/dyCXR3dfINcPELUAQ&r=tryAPL&l=apl-dyalog-e... (more) |
— | over 3 years ago |
Edit | Post #281406 | Initial revision | — | over 3 years ago |
Answer | — |
A: Beaver Code Decryption APL(Dyalog Extended), 32 bytes SBCS ``` {1=≢⍵:⍵⋄0⍨,⍉↑∇¨↓2 ¯1⍴⍵,0/⍨2|≢⍵} ``` Try it on APLgolf! A dfn submission which takes a string as input. I thought this would be much shorter, but it's only a small improvement over unicode. (more) |
— | over 3 years ago |
Edit | Post #281405 |
Post edited: |
— | over 3 years ago |
Edit | Post #281405 | Initial revision | — | over 3 years ago |
Answer | — |
A: Beaver Code Decryption [Husk], 8 bytes ΣTm?I₀ε½ Try it online! It's jelly but reversed. 1 byte lesser due to a single byte halve. (more) |
— | over 3 years ago |
Comment | Post #281401 |
The chat says it assumes input length is under some limit?
(more) |
— | over 3 years ago |
Edit | Post #281382 | Initial revision | — | over 3 years ago |
Answer | — |
A: Cumulative Counts [Husk], 4 bytes Sz#ḣ Try it online! Explanation ``` Sz#ḣ Sz zip the input ḣ with its prefixes # using the count function (more) |
— | over 3 years ago |
Comment | Post #281372 |
`1⊥¨⊢=,\` here you go (more) |
— | over 3 years ago |
Comment | Post #281371 |
and you can preserve the same length by changing `1 1∘⍉` → ` 1 1⍉` (more) |
— | over 3 years ago |
Comment | Post #279770 |
I think this looks good. Could diagonal lines be a thing? (more) |
— | over 3 years ago |
Comment | Post #279883 |
welp, feel free to do it this year then. (more) |
— | over 3 years ago |
Edit | Post #281028 | Initial revision | — | over 3 years ago |
Question | — |
Allow linking account with Code Golf Stack Exchange In my user preferences in "Edit Profile", under the "Link Stack Exchange Account" heading, this shows up: You can't link a Stack Exchange account to your account on this site because there is no associated Stack Exchange site from which to transfer your content. An association with Code Golf Sta... (more) |
— | over 3 years ago |
Edit | Post #280754 |
Post edited: |
— | over 3 years ago |
Edit | Post #280882 |
Post edited: |
— | over 3 years ago |
Edit | Post #280882 | Initial revision | — | over 3 years ago |
Question | — |
Word Set Square Challenge Given a string, e.g. `Hello`, do the following: Mirror it: ``` Hello -> HelloolleH ``` and create a right triangle using it as the sides: ``` H ee l l l l o o o o l l l l e e HelloolleH ``` Which ... (more) |
— | over 3 years ago |
Edit | Post #280863 |
Post edited: |
— | almost 4 years ago |
Edit | Post #280863 | Initial revision | — | almost 4 years ago |
Answer | — |
A: Ratio limits of fibonacci-like series Stax, 5 bytes òP^↓Φ Run and debug it Same idea as Quintec's answer. Input as a floating point number. Explanation ``` 1gpun+ 1 start with 1 gp apply the following till a fixpoint: u reciprocal n+ add the input (more) |
— | almost 4 years ago |
Comment | Post #280839 |
Not sure why short circuiting isn't working here: [Try it online!](https://tio.run/##K6gsycjPM/7/P802JzE3KSVRocJKo8LGKDEvRaFCM79IwUgrTaNC11BTG0QZaf4vKMrMK9FI0zDR1PwPAA "Python 3 – Try It Online") (more) |
— | almost 4 years ago |
Comment | Post #280840 |
remove the brackets for -2 (more) |
— | almost 4 years ago |
Comment | Post #280840 |
ah ok makes sense (more) |
— | almost 4 years ago |
Comment | Post #280840 |
I got [19 bytes](https://razetime.github.io/APLgolf/?h=AwA&c=e9S1SF9HW@/w9Ee9ix/1TX3Uu8JIF0g86pihpw2ie/Y@6t1sBAA&f=AwA&i=S@My4ErjMgRiUwA&r=tio&l=apl-dyalog&m=tradfn&n=f): `⊢/,+.×⍣⎕⍨2-⍨∘.+⍨⌽⍳2` from it (more) |
— | almost 4 years ago |
Comment | Post #280840 |
I think your link is wrong, and the program doesn't seem to work correctly (more) |
— | almost 4 years ago |
Comment | Post #280840 |
[-1 byte](https://tio.run/##SyzI0U2pTMzJT9dNzkksLs5M/v@/@lHvVhsjKyD5qLtFW/9RR/uhFUCOrqHOo97NRrX/0x61TXjU2/eoq/lR75pHvVsOrTd@1DbxUd/U4CBnIBni4Rn8Pw2kZbOhAQA "APL (Dyalog Classic) – Try It Online") (more) |
— | almost 4 years ago |
Comment | Post #280840 |
[fun matrix multiplication(20)](https://razetime.github.io/APLgolf/?h=AwA&c=M3nU1ayjrXd4@qPexY/6pj7qXWGkYPSod4uRgiEQGgAA&f=AwA&i=S@My4ErjMgRiUwA&r=tio&l=apl-dyalog&m=tradfn&n=f): `4⊃,+.×⍣⎕⍨2 2⍴2 1 1 0` (more) |
— | almost 4 years ago |
Comment | Post #280832 |
@Hakerh400 should work correctly now (more) |
— | almost 4 years ago |
Edit | Post #280832 |
Post edited: |
— | almost 4 years ago |
Edit | Post #280832 | Initial revision | — | almost 4 years ago |
Answer | — |
A: Is it a near-anagram? Stax, 12 bytes ä╫◙=♥:≡ƒélΣæ Run and debug it +3 after correcting it(thanks, HakerH) Explanation ``` b%s%>{s}M|-%1= b copy the two inputs %s%> is the first's length < second? {s}M if so, swap the two |- multiset difference % ... (more) |
— | almost 4 years ago |
Edit | Post #280753 |
Post edited: finalized |
— | almost 4 years ago |
Edit | Post #280828 | Initial revision | — | almost 4 years ago |
Question | — |
The Pell Numbers 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) |
— | almost 4 years ago |
Comment | Post #280729 |
yep, 6 bytes is possible :P (more) |
— | almost 4 years ago |
Edit | Post #280729 |
Post edited: |
— | almost 4 years ago |
Comment | Post #280729 |
wow whut, is that documented anywhere?
(more) |
— | almost 4 years ago |
Edit | Post #280729 |
Post edited: |
— | almost 4 years ago |
Comment | Post #280754 |
Because they are hollow in the middle (more) |
— | almost 4 years ago |
Edit | Post #280754 | Initial revision | — | almost 4 years ago |
Article | — |
Word Set Square[FINALIZED] Challenge Given a string, e.g. `Hello`, do the following: Mirror it: ``` Hello -> HelloolleH ``` and create a right triangle using it as the sides: ``` H ee l l l l o o o o l l l l e e HelloolleH ``` Which ... (more) |
— | almost 4 years ago |