Activity for WheatWizardâ€
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Edit | Post #291226 |
Post edited: RM double title. |
— | 9 months ago |
| Edit | Post #291226 |
Post edited: |
— | 9 months ago |
| Edit | Post #291226 | Initial revision | — | 9 months ago |
| Question | — |
Construct the Irish possessive In this challenge you will take an Irish word and a personal pronoun and create the possessive pronoun construction combining the two. For example `sé`, `madra` becomes `a mhadra`. Translated to English `he`, `dog` becomes `his dog`. Rather than exhaustively describing how valid Irish words are... (more) |
— | 9 months ago |
| Edit | Post #290974 | Initial revision | — | 10 months ago |
| Question | — |
Can I follow this recipe? You work in a kitchen which has a peculiar rule. When you mix something into a pot you must always add at least one new ingredient. So you can add pasta, oil, salt then pesto, but not pasta, pesto, salt and oil since pesto already contains salt and oil. You only have one pot per dish, so you can't... (more) |
— | 10 months ago |
| Edit | Post #290437 |
Post edited: |
— | about 1 year ago |
| Edit | Post #290437 |
Post edited: |
— | about 1 year ago |
| Edit | Post #290437 |
Post edited: |
— | about 1 year ago |
| Edit | Post #290437 | Initial revision | — | about 1 year ago |
| Question | — |
Is it stuck in a counting loop? Given a list of non-negative integers the function $f$ replaces every integer with the number of identical integers preceding it (not necessarily contiguously). So ``` f [1,1,2,2,1,3,3] = [1,2,1,2,3,1,2] ``` We will say that a list, $X$, is in a loop if there is some positive integer $n$ such... (more) |
— | about 1 year ago |
| Edit | Post #290065 |
Post edited: Update. |
— | about 1 year ago |
| Edit | Post #290065 |
Post edited: Code formatting. |
— | about 1 year ago |
| Edit | Post #290065 | Initial revision | — | about 1 year ago |
| Question | — |
Is it a valid hidden word? The Universal Crossword has a set of guidelines for crossword puzzle submissions. In this challenge we are going to be concerned with their rules for hidden word themes. A hidden word clue consists of a clue and a word. It can either be a "word break" or a "bookend". For a word break the word... (more) |
— | about 1 year ago |
| Comment | Post #290027 |
Fixed. Not sure what the point of sandboxing is on a site which only has 3-4 active users. (more) |
— | about 1 year ago |
| Edit | Post #290027 |
Post edited: |
— | about 1 year ago |
| Edit | Post #290027 |
Post edited: |
— | about 1 year ago |
| Edit | Post #290027 | Initial revision | — | about 1 year ago |
| Question | — |
How many umbrellas to cover the beach? You work at a beach. In the afternoon, the sun gets quite hot and beachgoers want to be shaded. So you put out umbrellas. When you put out umbrellas you want to shade the entire beach, with as few umbrellas as possible. Umbrellas come in many sizes. However, larger umbrellas are susceptible to bei... (more) |
— | about 1 year ago |
| Comment | Post #289852 |
It's the first. I clarified it. Thanks. (more) |
— | about 1 year ago |
| Edit | Post #289852 |
Post edited: Clarify |
— | about 1 year ago |
| Edit | Post #289852 | Initial revision | — | about 1 year ago |
| Question | — |
I irradiate your source code, you irradiate your output Your task is to write a program $p$ which outputs a string $s$ with the same length as $p$, where $s \neq p$. If I remove the $n$th byte from your program to get program $q$, then either $q$ outputs $s$ with the $n$th byte removed, or it does something else. Your score is the number of ways a s... (more) |
— | about 1 year ago |
| Comment | Post #289679 |
1. With a normal form of output (e.g. 1 and 0) the set of problems that can be solved is the set of computable decision problems. With halting/non-halting output, the set of problems that can be solved is the set of limit computable decision problems. This includes famously non-computable problems ... (more) |
— | over 1 year ago |
| Comment | Post #289679 |
I'm in opposition to this for two reasons. 1. it is not a trivial change in IO, it is a very fundamental change in what can and can't be done. 2. It is not modular, programs written this way can only be combined as part of larger programs in limited ways.
(more) |
— | over 1 year ago |
| Edit | Post #289447 |
Post edited: Stipulated that the intermediate values must be integers. |
— | over 1 year ago |
| Edit | Post #289447 |
Post edited: |
— | over 1 year ago |
| Edit | Post #289447 | Initial revision | — | over 1 year ago |
| Question | — |
Give the fool's fibonacci sequence Recently I asked for tips on improving some code-golf of mine. The code was supposed to output every third value of the Fibonacci sequence starting with 2: ``` 2,8,34,144,610,2584,10946,46368,196418,832040 ``` However, I made a mistake in deriving my formula, and my code output a different s... (more) |
— | over 1 year ago |
| Comment | Post #288535 |
You don't get to assume a maximum on these values. (more) |
— | over 1 year ago |
| Comment | Post #288943 |
The result can be exactly $-1, 0, 1$ if no other residue is one of those three residues (and each of those three occurs at least once).
For example look at the example 6. 6 is 0 mod 2, 0 mod 3, 1 mod 5, -1 mod 7. The value 0 occurs twice, this is how you only have 3 values for high $n$. (more) |
— | over 1 year ago |
| Edit | Post #289152 | Initial revision | — | over 1 year ago |
| Question | — |
Reverse engineer the colors for a layout. At my job we have to sometimes lay out materials. Materials come in large long rolls and are cut into smaller pieces when being laid out. When we order the rolls we draw up a layout document which describes how we are going to cut them and layout the pieces. This tells the manufacturer how we are ... (more) |
— | over 1 year ago |
| Edit | Post #288943 |
Post edited: |
— | over 1 year ago |
| Comment | Post #288943 |
No, the set needs to be exactly equal to, not just a subset of. (more) |
— | over 1 year ago |
| Edit | Post #288943 | Initial revision | — | over 1 year ago |
| Question | — |
Find near miss prime multiples. Given a number $n \geq 3$ as input output the smallest number $k$ such that the modular residues of $k$ by the first $n$ primes is exactly $\{-1,0,1\}$. That is there is a prime in the first $n$ primes that divides $k$, one that divides $k+1$ and one that divides $k-1$, and every prime in the firs... (more) |
— | over 1 year ago |
| Comment | Post #288885 |
Ah thanks. I blame me missing that on the fact I was expecting to see a numeral. (more) |
— | over 1 year ago |
| Comment | Post #288885 |
You should probably mention that dice have 6 faces, currently it has to be intuited from test cases. (more) |
— | over 1 year ago |
| Edit | Post #288689 | Initial revision | — | over 1 year ago |
| Question | — |
Prove commutativity on this monoid presentation. Given two binary strings $A$ and $B$ such that $A$ is an anagram of $B$, output a third binary string $S$ such that both $A$ and $B$ can be created by iterated removals of the substring $10101$ from $S$. For example for $A=100$ and $B = 010$, one solution is $S = 10101010$ since $$ (10101)01... (more) |
— | over 1 year ago |
| Comment | Post #283305 |
Haskell + [hgl](https://gitlab.com/wheatwizard/haskell-golfing-library), 2 bytes: `lq` (more) |
— | over 1 year ago |
| Edit | Post #288684 | Initial revision | — | over 1 year 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) |
— | over 1 year ago |
| Comment | Post #288683 |
That big O notation simplifies to $O(n^2)$. (more) |
— | over 1 year ago |
| Edit | Post #288653 | Initial revision | — | over 1 year 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) |
— | over 1 year 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) |
— | over 1 year ago |
| Edit | Post #288622 |
Post edited: Better wording. |
— | over 1 year ago |