Activity for Razetime
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Comment | Post #282241 |
i don't think you need the tags for the text to display. (more) |
— | over 3 years ago |
| Edit | Post #282617 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Add two negabinary integers [Ruby], 75 bytes ->t,u{g=->a{a.reduce{-21+2}};('%b'%(g[t]+g[u]+(y=43690)^y)).toi.digits} Try it online! Uses latest ruby features, so tio link will look different. Takes two digit arrays, and returns an array which represents the negabinary integer. Borrows from a conversion... (more) |
— | over 3 years ago |
| Comment | Post #280753 |
it's here: https://codegolf.codidact.com/posts/280828 (more) |
— | over 3 years ago |
| Comment | Post #282511 |
I want to bounty this so bad (more) |
— | over 3 years ago |
| Comment | Post #282491 |
since the leaderboard notices the `+` as a flag addition, it may be better to have a naming convention replacing such a thing with `-` or `:` (more) |
— | over 3 years ago |
| Edit | Post #282503 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Shuffle a subset of a list APL(Dyalog Unicode), 13 bytes SBCS ``` {⍵[?⍨≢⍵]}@⎕⊢⎕ ``` Try it on APLgolf! A tradfn submission which takes both lists on STDIN, second input is 1-indexed. (more) |
— | over 3 years ago |
| Comment | Post #282483 |
Adding extra library counts acts similar to a flag, and many challenges which require specialized output(graphical ones especially) require libraries because the language wouldn't be able to compete without it, so it is definitely encouraged to do so. (more) |
— | over 3 years ago |
| Edit | Post #282462 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Leaderboards are live Few QoL improvements can be made: Some trivial challenges(i.e. "Hello World!") get many, many answers, so the leaderboard should show a scrollbar beyond some point(after the first 10 submissions, maybe?). Another thing I'd like to see is the ability to hide the leaderboard, preferably by click... (more) |
— | over 3 years ago |
| Edit | Post #282461 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Evens or Odds - you know this one [MAWP], 8 bytes ``` @!2P2WA: ``` Try it! 1 for odd and zero for even. mawp doesn't have modulus, so it floor divides by 2, multiplies by 2 and subtracts from the input. (more) |
— | over 3 years ago |
| Comment | Post #282345 |
This is a kind of interesting source-layout challenge, but i think you need more restrictions(i.e. line length must be divisible by 5 or 3) and you need to be more stringent with the restrictions(aka, line numbers are always enforced from beginning of file) (more) |
— | over 3 years ago |
| Comment | Post #282334 |
this is *extremely* trivial in most languages and is oftentimes a very basic elementary operation in challenges. (more) |
— | over 3 years ago |
| Comment | Post #281572 |
no, fractions are mandatory. (more) |
— | over 3 years ago |
| Comment | Post #282301 |
(the same applies to the chars in between as well) (more) |
— | over 3 years ago |
| Comment | Post #282301 |
The last line should be `HelloolleH`, not `HellolleH` (more) |
— | over 3 years ago |
| Edit | Post #282280 |
Post edited: fix last test case minus |
— | over 3 years ago |
| Edit | Post #282285 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Word Count Tool [Ruby], 55 bytes ->a{[a.split,a.tr($/,''),a.gsub(/[ ]/,'')].map &:size} Try it online! `split` removes all whitespace, but `lines` doesn't for some reason. Would've been useful in place of the `tr`. (more) |
— | over 3 years ago |
| Suggested Edit | Post #282280 |
Suggested edit: fix last test case minus (more) |
helpful | over 3 years ago |
| Comment | Post #282260 |
`Π` (product) may help with your `u⌐` method to save some instructions. (more) |
— | over 3 years ago |
| Edit | Post #282247 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Are they abundant, deficient or perfect? [Husk], 10 bytes kSo±-ȯΣhḊḣ Try it online! `keyon` is very nice here, but it's still a bit too long, sadly. (more) |
— | over 3 years ago |
| Comment | Post #281962 |
[twins](https://codegolf.stackexchange.com/a/169388/80214)
(more) |
— | over 3 years ago |
| Edit | Post #282153 | Initial revision | — | over 3 years ago |
| Question | — |
Diagonalized alphabet Task Print the following: ``` ABDFHJLNPRTVXZ CABDFHJLNPRTVX ECABDFHJLNPRTV GECABDFHJLNPRT IGECABDFHJLNPR KIGECABDFHJLNP MKIGECABDFHJLN OMKIGECABDFHJL QOMKIGECABDFHJ SQOMKIGECABDFH USQOMKIGECABDF WUSQOMKIGECABD YWUSQOMKIGECAB ``` and nothing else. You may return a multiline string o... (more) |
— | over 3 years ago |
| Edit | Post #282130 |
Post edited: |
— | over 3 years ago |
| Edit | Post #282130 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Evaluation order of an APL n-train [Husk], 8 bytes ηÖ↔mo⌈½ŀ Try it online! Same idea as xash's answer from CGCC. (more) |
— | over 3 years ago |
| Edit | Post #281980 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Backspace an array [Husk], 6 bytes Fo+hx0 Try it online! there's got to be a smarter way to do this with grouping. (more) |
— | over 3 years ago |
| Edit | Post #281603 |
Post edited: |
— | over 3 years ago |
| Comment | Post #281608 |
`1/2.0` can be `.5`
(more) |
— | over 3 years ago |
| Edit | Post #281603 |
Post edited: |
— | over 3 years ago |
| Edit | Post #281603 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Juggler sequences [Husk], 11 10 bytes U¡λ⌊^+.%2¹ Try it online! This can probably be trivially ported to Jelly. Explanation ``` U¡o⌊Ṡ^o+.%2 ¡ iterate over the input infinitely, creating a list o with the following two functions: Ṡ^ take the previous result ... (more) |
— | over 3 years ago |
| Edit | Post #281572 |
Post edited: |
— | over 3 years ago |
| Comment | Post #281595 |
I'll change the first test case to your output in `⎕FR←1287⋄⎕PP←34`
(more) |
— | over 3 years ago |
| Comment | Post #281595 |
finding tests for this is a bit of a pain.. everything's in some weird modulo or prime factorization format aaaaa
(more) |
— | over 3 years ago |
| Edit | Post #281572 |
Post edited: |
— | over 3 years ago |
| Comment | Post #281572 |
yeah, I wrote that wrong. It's an infinite loop which cycles through 2^n, where n is prime. (more) |
— | over 3 years ago |
| Edit | Post #281572 |
Post edited: |
— | over 3 years ago |
| Edit | Post #281572 | Initial revision | — | over 3 years ago |
| Question | — |
Golf a FRACTRAN interpreter Description From the Esolangs wiki, In Fractran, - a program consists of a finite list of positive, rational numbers. - The input to a program is a positive integer n. - The list is then searched in order, for a rational number \$p/q\$ such that \$n×p/q\$ is an integer. - Then n is replaced ... (more) |
— | over 3 years ago |
| Edit | Post #281545 | Initial revision | — | over 3 years ago |
| Answer | — |
A: Merge two strings APL(Dyalog Unicode), 26 bytes SBCS ``` {⊃x/⍨⊃¨⍺∘⍷¨x←,∘⍵¨(⊂⍬),,\⍺} ``` Try it on APLgolf! A dfn submission which takes the inputs as left and right argument. I took way too long to come up with this. Fun challenge. (more) |
— | over 3 years ago |
| Edit | Post #281529 |
Post edited: |
— | over 3 years ago |
| Edit | Post #281529 | Initial revision | — | over 3 years ago |