Timeline for Sandbox for Proposed Challenges
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 26, 2019 at 6:22 | comment | added | xnor | @FryAmTheEggman You're probably right, answers would mostly just do the expression in some loop. In Haskell I think the interleaving definition wins out (even with option 1 allowed), but maybe that's just Haskell. | |
| Feb 25, 2019 at 22:09 | comment | added | FryAmTheEggman | @xnor Do you think removing that option will help much? I can't really think of a case where the solution won't be to wrap your expression in a looping construct if the expression was the shortest. I don't think knowing the history of this function is that helpful to finding the future value. | |
| Feb 15, 2019 at 1:09 | comment | added | xnor |
It looks like n/(n&-n)/2+1 would work for a lot of languages such as Python.
|
|
| Feb 15, 2019 at 0:46 | comment | added | xnor |
You could consider removing the option to output just the n'th term, making answers output a sequence. Otherwise I think it will be shortest in most languages to take n, halve until non-whole, then add 1/2 (ceiling), rather than use the interleaving property which I think is cooler.
|
|
| Feb 13, 2019 at 19:35 | comment | added | dzaima | related (not a dupe though) | |
| Feb 13, 2019 at 18:23 | history | answered | Khuldraeseth na'Barya | CC BY-SA 4.0 |