Activity for WheatWizardâ€
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Edit | Post #288684 | Initial revision | — | almost 2 years ago |
| Answer | — |
A: Cumulative Counts Haskell + hgl, 10 bytes ```haskell mpn$ce<gj ```` Attempt This Online! Explanation - `mpn` map across all non-empty prefixes of the input ... - `ce` count the number of elements in each prefix equal to ... - `gj` the last element of that prefix. Reflection I'm happy with this. ... (more) |
— | almost 2 years ago |
| Comment | Post #288683 |
That big O notation simplifies to $O(n^2)$. (more) |
— | almost 2 years ago |
| Edit | Post #288653 | Initial revision | — | almost 2 years ago |
| Answer | — |
A: Build a replacement ball in regex. Haskell + hgl, 30 bytes ```haskell ic"|"<pST<eL<P1 ``` This version is much longer, but in my opinion it has better potential to be shorter than the above version if hgl were improved. Explanation This adds a dummy character `?` to the front of the list then gets all ways to partition t... (more) |
— | almost 2 years ago |
| Comment | Post #288548 |
Ok, I should have seen that. I'm going to suggest adding a rounded up dummy score for the time being, and then to fix the leaderboard. I'll edit my answer in a bit. (more) |
— | almost 2 years ago |
| Edit | Post #288622 |
Post edited: Better wording. |
— | almost 2 years ago |
| Edit | Post #288622 |
Post edited: |
— | almost 2 years ago |
| Edit | Post #288622 | Post undeleted | — | almost 2 years ago |
| Edit | Post #288622 | Post deleted | — | almost 2 years ago |
| Edit | Post #288622 | Initial revision | — | almost 2 years ago |
| Question | — |
Are these reduced forms of the same thing? Task You are going to take three strings as input $A$, $B$ and $X$. And your goal is to determine if there exists a third string $S$ such that both $A$ and $B$ can be formed by iteratively removing contiguous instances of $X$ in $S$. For example if $X = 10101$ then both $10$ and $01$ can be forme... (more) |
— | almost 2 years ago |
| Edit | Post #288563 |
Post edited: |
— | almost 2 years ago |
| Edit | Post #288563 | Initial revision | — | almost 2 years ago |
| Question | — |
Build a replacement ball in regex. In this challenge you will take a number $n$ and a string $X$ of length $\geq n$, and produce a regular expression which matches all strings that are withing $n$ character substitutions of $X$. Specifically you will take $X$ and $n$ and ouptut all the ways to replace exactly $n$ characters with th... (more) |
— | almost 2 years ago |
| Edit | Post #288555 |
Post edited: |
— | almost 2 years ago |
| Edit | Post #288555 | Initial revision | — | almost 2 years ago |
| Answer | — |
A: Efficient censorship Haskell + hgl, 14 bytes ```haskell xBl<fn<iw ```` Attempt This Online! Explanation `ss` gets all substrings of the input `fn` filters out the substrings that don't ... `iw` checks if the forbidden word is a contiguous substring `xBl` gets the largest result Reflection There... (more) |
— | almost 2 years ago |
| Comment | Post #288548 |
Actually the leaderboard currently floors the fractional score so there's no use in making a dummy score. I've changed my suggestion to "update the leaderboard to support how people are scoring". (more) |
— | almost 2 years ago |
| Edit | Post #288548 |
Post edited: |
— | almost 2 years ago |
| Comment | Post #288548 |
In the last section I'm suggesting that if the leaderboard is not changed, we include a dummy count so the leaderboard scores it predictably. I'll try to reword it. (more) |
— | almost 2 years ago |
| Comment | Post #288548 |
Maybe I am no expressing myself most clearly. I am saying that the in effect disalllowing and allowing fractional bytes are not tangibly different. I assume the leaderboard doesn't change because it illustrates this point most expressly. (more) |
— | almost 2 years ago |
| Edit | Post #288548 |
Post edited: |
— | almost 2 years ago |
| Edit | Post #288548 | Initial revision | — | almost 2 years ago |
| Answer | — |
A: Codidact Fractional Byte Consensus I'm going to reiterate and build off ideas I laid out on this post on PPCG. First let's point out that at current the leader board does not support fractional scores. In this answer I am going to assume this is unchanged. That may prove to be false, in fact I think it is likely a false assumption,... (more) |
— | almost 2 years ago |
| Edit | Post #288535 | Initial revision | — | almost 2 years ago |
| Question | — |
Efficient censorship You are a low-level censor working for the Ministry of Media Accuracy. Part of your job is to make sure that certain words don't appear in publications. Every morning you get a fresh stack of next week's newspapers and its your job to comb through them and fix any of the words that were mistakenly i... (more) |
— | almost 2 years ago |
| Comment | Post #288526 |
Thanks I fixed it. And it seems the new alignments are golfier since the fixed program comes out 2 bytes shorter. (more) |
— | almost 2 years ago |
| Edit | Post #288526 |
Post edited: Fixed alignment |
— | almost 2 years ago |
| Edit | Post #288526 |
Post edited: Improved score. |
— | almost 2 years ago |
| Edit | Post #288526 |
Post edited: |
— | almost 2 years ago |
| Edit | Post #288526 | Initial revision | — | almost 2 years ago |
| Answer | — |
A: Connect the corners without 4 in a row Haskell + hgl, 134 bytes ```haskell k=cy"X.XX" x#1=[4,0,9,9]!x 2#y=8 3#y=[8,9,4,4]!y x#3=[0,3]!x #=0 x?y|(n,j)<-fvD 4$x%4#(y%4)=tk y$dr j$tk x<dr n<cy[dr2 k,k,cy".X",k] ```` Attempt This Online! I first set up a pretty dense background pattern which doesn't break any rules: ``` X... (more) |
— | almost 2 years ago |
| Edit | Post #288516 |
Post edited: |
— | almost 2 years ago |
| Edit | Post #288516 | Initial revision | — | almost 2 years ago |
| Question | — |
Calculate the Z-array Task Given a list of numbers $X$ produce a second list of numbers $Y$ such that $Yi$ is the length of the longest common prefix of $X$ and $X$ with the first $i$ elements removed. For example if the input is ``` [1,2,2,1,1,2,1,2,2,1,2,1] ``` The output should be ``` [12,0,0,1,2,0,4,... (more) |
— | almost 2 years ago |
| Edit | Post #288398 |
Post edited: More examples. |
— | almost 2 years ago |
| Edit | Post #288503 | Initial revision | — | almost 2 years ago |
| Question | — |
Count polyomino bisections An polyomino is a non-empty connected subset of the square tiling consisting of squares joined along their edges. We will not require that polyominos be simply connected, that is they can have holes. A bisection of a polyomino $X$ is a pair of polyominos such that they can be joined together witho... (more) |
— | almost 2 years ago |
| Edit | Post #288398 |
Post edited: Holes. |
— | almost 2 years ago |
| Comment | Post #288398 |
The current definition of polyomino doesn't disallow holes. I'll try to work that explicitly into the text. (more) |
— | almost 2 years ago |
| Edit | Post #288398 |
Post edited: |
— | almost 2 years ago |
| Comment | Post #288398 |
Ah I think you are misunderstanding, the you are dividing it into k-polyominos. There are no additional requirements on these polyominos. So
```text
X XX
XXXXX
```
can be subdivided into a T-tetramino and a O-tetramino. It doesn't matter that these are not the same 4-polyomino. You just ... (more) |
— | almost 2 years ago |
| Comment | Post #288398 |
I'm not sure what you mean. There's no canonical way to select an enantiomorph, so yes it is possible for to mirror images to be inputs, if that's what you are asking. No part of this question involves determining if two polyominos are equal so it shouldn't matter whether you consider chiral pairs t... (more) |
— | almost 2 years ago |
| Comment | Post #288398 |
Input a polyomino is intended to be flexible. I'd be certainly be willing to let you take a list of coordinates, and I believe if taking a list it is acceptable to also take its length. So that would be one way to take the input with the number of squares. (more) |
— | almost 2 years ago |
| Edit | Post #288398 | Initial revision | — | almost 2 years ago |
| Question | — |
Determine if a polyomino is "prime" An $n$-polyomino is a connected subset of the square tiling consisting of $n$ squares. We will not require that polyominos be simply connected, that is they can have holes. We will say a $n$-polyomino is prime if it cannot be disected into disjoint $k$-polyominos for any 1<$k$<$n$. For example th... (more) |
— | almost 2 years ago |
- ← Previous
- 1
- 2
- Next →