Timeline for Sandbox for Proposed Challenges
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:03 | history | edited | CommunityBot |
Commonmark migration
|
|
| Apr 11, 2019 at 12:38 | history | edited | flawr | CC BY-SA 4.0 |
edited body
|
| Feb 27, 2019 at 18:29 | comment | added | Spitemaster | Also note that the set {1} is not product free - 1*1=1, which is in {1}. | |
| Feb 27, 2019 at 18:28 | comment | added | Spitemaster | You can make this work by having a secondary scoring algorithm. You could, for example, score the programs by {bytes}*{total score for n=1 to 100}, where the score for an input is the highest number in the output set. | |
| Feb 26, 2019 at 21:36 | history | edited | flawr | CC BY-SA 4.0 |
added 273 characters in body
|
| Feb 26, 2019 at 10:42 | comment | added | flawr |
@Emigna Thanks for the feedback, you're right this is not something I considered. Maybe it helps if we allow any number of additions/multiplications? But in this case I think you could just use [k+1,k+2,k+3,...,n] for some large enough k (depending on n). Maybe I should add some condition that requires the numbers to be very small to make it more interesting. It definitely needs some more work.
|
|
| Feb 26, 2019 at 10:09 | comment | added | Emigna |
I'm a bit concerned that this would just be output the first n odd primes, but maybe non-golfing languages can do something more interesting than that.
|
|
| Feb 26, 2019 at 9:18 | history | answered | flawr | CC BY-SA 4.0 |