Activity for Razetime
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Edit | Post #290626 |
Post edited: |
— | over 1 year ago |
| Edit | Post #290626 | Initial revision | — | over 1 year ago |
| Answer | — |
A: Plain black webpage HTML, 16 bytes ``` ``` an attribute that works well for this challenge. tested on Mozilla Firefox. -3 from `[Object object]` (more) |
— | over 1 year ago |
| Comment | Post #290206 |
I tried using `!!` and came up with this: [run online](https://ato.pxeger.com/run?1=PU49DoIwGN09RUkYWrENIJZihEVuIQ4NFG2k0GBJDFdxYTGeydsIEdne7_e95_vK7zdRVcPw6kyJ2SeVSjetASk3nBwbpSvxWJUxzHKcwIOPiOKXWpquEDaURrTcCJj1OOnXvZOjHFmWR9F8K1Nc1rFuZW1sxTUowQlijzDquzRCYO8AiF2yDQLmhxRtFjg5CxnlMc4iOsvhbuqH59-P_-4v)... (more) |
— | over 1 year ago |
| Comment | Post #290206 |
using 3rd party libs is perfectly fine. Wheat Wizard for example uses their own haskell golfing library, hgl. you just have to mention that you used them. People generally try to achieve the best solution with the same combo of language+library+flags/etc. it is quite flexible.
You can find the conse... (more) |
— | over 1 year ago |
| Edit | Post #290171 | Initial revision | — | over 1 year ago |
| Answer | — |
A: Is it a valid hidden word? Ruby, 128 bytes ```ruby ->x,y{g=->c{c.chars.join" ?"} !x[y]&&(x.match?(/.+#{g[y]}.+/)||(0...(y.size-1)).any?{x[/^#{g[y[0..1]]}.+#{g[y[(1+1)..]]}$/]})} ``` Attempt This Online! bookends are found with a constructed regex that takes most of the bytes. (more) |
— | over 1 year ago |
| Comment | Post #285880 |
in brainfuck/any language that doesn't use 0-9, it is redundant to post an answer. if there is a representation for floats/fractions that you can reasonably explain in your answer, that is perfectly fine. (more) |
— | almost 2 years ago |
| Edit | Post #288626 | Initial revision | — | almost 2 years ago |
| Answer | — |
A: Build a replacement ball in regex. Ruby, 82 bytes ```ruby ->w,n{[0...w.size].permutation(n).map{e=w1;1.map{|x|e[x]='.'};e}.uniq.join '|'} ```` Attempt This Online! uses `permutation` to do most of the work. Might be shorter with something recursive, maybe. (more) |
— | almost 2 years ago |
| Edit | Post #287530 | Initial revision | — | over 2 years ago |
| Answer | — |
A: Encode with ROT13.5 Stax, 15 bytes ⌐♪aù¢φσX▀┼╜°«↕j Run and debug it (more) |
— | over 2 years ago |
| Edit | Post #287310 | Initial revision | — | over 2 years ago |
| Answer | — |
A: Knight safe squares APL(Dyalog Unicode), 64 bytes SBCS ``` {64-≢∪x,u/⍨∧/¨(>∘0∧<∘9)u←⊃,/(a/⍨2|+/¨|a←,∘.,⍨1 2,-1 2)∘+∘⊂¨x←⍸⍵} ``` Try it on APLgolf! A dfn which takes a boolean grid. (more) |
— | over 2 years ago |
| Edit | Post #287208 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287208 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287208 | Initial revision | — | over 2 years ago |
| Answer | — |
A: Lowercase, but not just the letters APL (Dyalog APL), 42 bytes ```apl {⎕UCS⊢2⊥1@2⊢(7⍴2)⊤⎕UCS⍵} ```` Attempt This Online! In APL, base encoding(`⊤`) returns a matrix, so setting the lowercase bit is very easy with `1@2`, setting the entire second row to 1. (more) |
— | over 2 years ago |
| Edit | Post #287206 | Initial revision | — | over 2 years ago |
| Answer | — |
A: Mediocre pop count APL (Dyalog APL), 61 bytes ``` {⍵/⍨(⊢∊⌊/,⌈/)+⌿0 1↓2⊥⍣¯1⊢0,⎕UCS⍵} ```` Attempt This Online! APL's style of filter works very well here, since we can check for the max and min elements here: ``` (⊢∊⌊/,⌈/) ``` and filter using the boolean mask later: ``` ⍵/⍨ ``` (more) |
— | over 2 years ago |
| Edit | Post #287148 |
Post edited: |
— | over 2 years ago |
| Edit | Post #287148 | Initial revision | — | over 2 years ago |
| Answer | — |
A: The holeyest base Ruby, 77 bytes ->x{(2..16).maxby{x.tos(1).chars.sum{|y|"".bytes[y.hex]}}} Attempt This Online! (more) |
— | over 2 years ago |
| Edit | Post #287120 |
Post edited: correct link to bytes |
— | over 2 years ago |
| Suggested Edit | Post #287120 |
Suggested edit: correct link to bytes (more) |
helpful | over 2 years ago |
| Comment | Post #287033 |
Older ideas were to allow the challenge creator to move their challenges over to the Q&A section. I don't think codidact has this functionality yet, so deleting is a good option. We can ask for the mods to help with this cleanup, and start delete votes on any finalized sandbox posts. (more) |
— | over 2 years ago |
| Comment | Post #286989 |
oh, sorry for the confusion. I've added the extra possible output. (more) |
— | over 2 years ago |
| Edit | Post #286989 |
Post edited: add to overlapping |
— | over 2 years ago |
| Edit | Post #286989 |
Post edited: |
— | over 2 years ago |
| Comment | Post #286989 |
ok, added to the question. (more) |
— | over 2 years ago |
| Edit | Post #286989 |
Post edited: |
— | over 2 years ago |
| Comment | Post #286989 |
sure, i'll make one but i'll have to label it as only one of the potential solutions.
(more) |
— | over 2 years ago |
| Edit | Post #286989 | Initial revision | — | over 2 years ago |
| Question | — |
Mark my beacons Given a grid of numbers, mark the concentric areas around nonzero elements (beacons) decreasing from the value of the beacon till 1. For example, here are some grids with a single beacon: Size 1: ``` 0 0 0 0 0 0 0 1 0 -> 0 1 0 0 0 0 0 0 0 ``` Size 2: ``` 0 0 0 1 1 1 0 2 0 -> 1... (more) |
— | over 2 years ago |
| Edit | Post #286967 | Initial revision | — | over 2 years ago |
| Article | — |
Mark my beacons Given a grid of numbers, mark the concentric areas around nonzero elements (beacons) decreasing from the value of the beacon till 1. For example, here are some grids with a single beacon: Size 1: ``` 0 0 0 0 0 0 0 1 0 -> 0 1 0 0 0 0 0 0 0 ``` Size 2: ``` 0 0 0 1 1 1 0 2 0 -> 1... (more) |
— | over 2 years ago |
| Comment | Post #286855 |
From the [wikipedia article](https://en.wikipedia.org/wiki/Harshad_number) it seems to have come the name of a mathematician who was discussing number theory. (more) |
— | almost 3 years ago |
| Comment | Post #286855 |
nah, first n. Having it that flexible is weird imo, so I draw the line at index origin. (more) |
— | almost 3 years ago |
| Edit | Post #286855 |
Post edited: |
— | almost 3 years ago |
| Edit | Post #286855 | Initial revision | — | almost 3 years ago |
| Question | — |
Find n Niven Numbers Challenge A Niven number is a positive integer which is divisible by the sum of its digits. For example, `81 -> 8+1=9 -> 81%9=0`. Your task is to find the first `n` Niven numbers, given `n`. Tests Reference implementation(takes input) first 16 values: ``` 0 => 1 1 => 2 2 => 3 3 =... (more) |
— | almost 3 years ago |
| Comment | Post #286603 |
1. Yes, the challenge is feasible in both ordinary languages and esolangs. A challenge like this will inevitably alienate a few languages and that is ok.
2. No, it is fine. Testing the limits of a language under uniqueness is the goal of this problem, and it's fine. If you allow a few important char... (more) |
— | almost 3 years ago |
| Comment | Post #286637 |
`set(x)` → `{*x}` (more) |
— | almost 3 years ago |
| Edit | Post #286630 | Initial revision | — | almost 3 years ago |
| Question | — |
Make a frequency table (histogram) Challenge Given an array in any suitable format, create a frequency table for it. i.e: Pair each unique element with the number of times it appears in the array. You can return the frequency table as a list of pairs, hashmap/dictionary, output the pairs directly, etc. Tests ``` { 1 1 2... (more) |
— | almost 3 years ago |
| Edit | Post #286629 | Initial revision | — | almost 3 years ago |
| Article | — |
Make a frequency table (histogram) Challenge Given an array in any suitable format, create a frequency table for it. i.e: Pair each unique element with the number of times it appears in the array. You can return the frequency table as a list of pairs, hashmap/dictionary, output the pairs directly, etc. Tests ``` { 1 1 2... (more) |
— | almost 3 years ago |
| Edit | Post #285924 |
Post edited: |
— | about 3 years ago |
| Edit | Post #286413 | Initial revision | — | about 3 years ago |
| Answer | — |
A: Does Looping Counter qualify as kolmogorov-complexity? No Your logic is correct. kolmogorov-complexity requires for the same constant fixed output across all solutions. This is not a static pattern, since it runs forever, so it doesn't fall under that umbrella. Allowing for a flexible character wouldn't really disqualify a question from kolmogorov co... (more) |
— | about 3 years ago |