Activity for WheatWizardâ€
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Comment | Post #293933 |
I split the first bullet in two, and I rewrote the second with less notation. A function is "from the rational numbers" if it takes rational numbers as its inputs (domain). Sometimes you forget that something is actually jargon ([xkcd](https://xkcd.com/2501/)), so I reworded this. Order equivalence i... (more) |
— | 13 days ago |
| Edit | Post #293933 |
Post edited: Simplify a bit. |
— | 13 days ago |
| Edit | Post #293933 |
Post edited: |
— | 14 days ago |
| Edit | Post #293933 |
Post edited: |
— | 14 days ago |
| Edit | Post #293933 | Initial revision | — | 14 days ago |
| Question | — |
Show order equivalence between the rationals and the binary fractions Write a function $f$ which takes rational numbers and gives binary fractions (rational numbers whose denominator is a power of two) which is bijective and preserves order. That means: - Different inputs give different outputs. - For every binary fraction $x$ there is a rational number $y$, such ... (more) |
— | 14 days ago |
| Comment | Post #293741 |
Yeah I struggle to think of a scenario in which "code-golf-tips" is anything but the intersection of "code-golf" and "tips". (more) |
— | about 1 month ago |
| Comment | Post #293741 |
I assume the intended usage is to differentiate between tips targeting other types of challenges. On SE they have a couple of questions asking for [tips in restricted source](https://codegolf.stackexchange.com/questions/209734/tips-for-restricted-source-in-python). (more) |
— | about 2 months ago |
| Edit | Post #293295 |
Post edited: Another thought. |
— | 4 months ago |
| Edit | Post #293295 |
Post edited: Another thought. |
— | 4 months ago |
| Edit | Post #293295 |
Post edited: Golf. |
— | 4 months ago |
| Edit | Post #293295 |
Post edited: Golf. |
— | 4 months ago |
| Edit | Post #293295 |
Post edited: Found the name of the tail map function. |
— | 4 months ago |
| Edit | Post #293295 | Initial revision | — | 4 months ago |
| Answer | — |
A: Expand a greyscale/colour hex code Haskell + hgl, 32 24 bytes ``` tlM$tk6<cy<fiI(rl2<)eL3 ``` Explanation `tlM` map a over the tail of the input ... `fiI` if ... `el3` the length is 3 `(rl2<)` repeat each letter in place twice. `cy` cycle the list indefinitely `tk6` take the first 6 characters. Reflection h... (more) |
— | 4 months ago |
| Edit | Post #291226 |
Post edited: RM double title. |
— | about 1 year ago |
| Edit | Post #291226 |
Post edited: |
— | about 1 year ago |
| Edit | Post #291226 | Initial revision | — | about 1 year 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) |
— | about 1 year ago |
| Edit | Post #290974 | Initial revision | — | about 1 year 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) |
— | about 1 year ago |
| Edit | Post #290437 |
Post edited: |
— | over 1 year ago |
| Edit | Post #290437 |
Post edited: |
— | over 1 year ago |
| Edit | Post #290437 |
Post edited: |
— | over 1 year ago |
| Edit | Post #290437 | Initial revision | — | over 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) |
— | over 1 year ago |
| Edit | Post #290065 |
Post edited: Update. |
— | over 1 year ago |
| Edit | Post #290065 |
Post edited: Code formatting. |
— | over 1 year ago |
| Edit | Post #290065 | Initial revision | — | over 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) |
— | over 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) |
— | over 1 year ago |
| Edit | Post #290027 |
Post edited: |
— | over 1 year ago |
| Edit | Post #290027 |
Post edited: |
— | over 1 year ago |
| Edit | Post #290027 | Initial revision | — | over 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) |
— | over 1 year ago |
| Comment | Post #289852 |
It's the first. I clarified it. Thanks. (more) |
— | over 1 year ago |
| Edit | Post #289852 |
Post edited: Clarify |
— | over 1 year ago |
| Edit | Post #289852 | Initial revision | — | over 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) |
— | over 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. |
— | almost 2 years ago |
| Edit | Post #289447 |
Post edited: |
— | almost 2 years ago |
| Edit | Post #289447 | Initial revision | — | almost 2 years 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) |
— | almost 2 years ago |
| Comment | Post #288535 |
You don't get to assume a maximum on these values. (more) |
— | almost 2 years 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) |
— | almost 2 years ago |
| Edit | Post #289152 | Initial revision | — | almost 2 years 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) |
— | almost 2 years ago |
| Edit | Post #288943 |
Post edited: |
— | almost 2 years ago |