Timeline for Given a list of circles, output the area of the smallest containing rectangle
Current License: CC BY-SA 3.0
29 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
S Aug 3, 2017 at 0:43 | history | bounty ended | geokavel | ||
S Aug 3, 2017 at 0:43 | history | notice removed | geokavel | ||
S Jul 28, 2017 at 7:19 | history | suggested | Евгений Новиков |
optimization tag added
|
|
Jul 28, 2017 at 6:27 | review | Suggested edits | |||
S Jul 28, 2017 at 7:19 | |||||
Jul 27, 2017 at 10:24 | comment | added | Anders Kaseorg | @xnor More test cases! :-) | |
Jul 27, 2017 at 9:44 | answer | added | Anders Kaseorg | timeline score: 17 | |
S Jul 27, 2017 at 4:10 | history | bounty started | geokavel | ||
S Jul 27, 2017 at 4:10 | history | notice added | geokavel | Draw attention | |
Jul 27, 2017 at 0:23 | history | edited | Tim | CC BY-SA 3.0 |
added 40 characters in body
|
Dec 24, 2016 at 2:19 | history | edited | Tim | CC BY-SA 3.0 |
added 47 characters in body
|
Aug 30, 2016 at 8:35 | history | tweeted | twitter.com/StackCodeGolf/status/770540392005632000 | ||
Aug 30, 2016 at 4:39 | comment | added | Tim | @xnor I would love to, but I'm making these by hand. I'll attempt a 6 one, but each circle added makes my wolfram alpha time increase dramatically. | |
Aug 30, 2016 at 2:03 | comment | added | xnor | @Tim It's on the harder side for a golf challenge, but I think that's fine. I expect many answers to try to brute force all packings to get the optimum and be really inefficient in run-time. Some larger test cases would be nice if you can generate them, in particular the upper limit of 6. | |
Aug 30, 2016 at 2:02 | history | edited | R. Kap | CC BY-SA 3.0 |
added 1 character in body
|
Aug 30, 2016 at 2:00 | history | edited | xnor | CC BY-SA 3.0 |
added 11 characters in body
|
Aug 30, 2016 at 1:59 | comment | added | Tim | @xnor I've gone for code golf, although I'm a little worried it's too tricky to get exact answers. And yes, updated the 3dp thing. Do you think "Into your program, try the three test cases. Your score is the absolute difference between the sum of the three test cases your code outputs, and the correct sum - 2186.891. This means you are aiming for a score of 0." would be suitable / better? | |
Aug 30, 2016 at 1:59 | history | edited | Tim | CC BY-SA 3.0 |
deleted 16 characters in body
|
Aug 30, 2016 at 1:58 | comment | added | xnor | I recommend getting rid of the "rounded not truncated" condition because it's peripheral to the task, and some languages can just do it while others need extra coding to make it happen. I'm not sure if you intend it to be OK to output more than 3 decimal places, but I'd suggest allowing that too. | |
Aug 30, 2016 at 1:58 | history | edited | Tim | CC BY-SA 3.0 |
added 223 characters in body
|
Aug 30, 2016 at 1:57 | history | edited | R. Kap | CC BY-SA 3.0 |
edited body
|
Aug 30, 2016 at 1:56 | history | edited | Tim | CC BY-SA 3.0 |
added 223 characters in body
|
Aug 30, 2016 at 1:56 | comment | added | xnor | @Tim Most are code golf, with the goal of coding it in the fewest bytes. I think this would make a good code golf challenge, as it has an exact spec. | |
Aug 30, 2016 at 1:52 | comment | added | Maltysen | that's one of our most central rules | |
Aug 30, 2016 at 1:50 | comment | added | Maltysen | i don't see an objective winning criterion | |
Aug 30, 2016 at 1:48 | history | edited | Tim | CC BY-SA 3.0 |
deleted 32 characters in body
|
Aug 30, 2016 at 1:44 | comment | added | DJMcMayhem | Related | |
Aug 30, 2016 at 1:44 | history | edited | Tim | CC BY-SA 3.0 |
added 4 characters in body
|
Aug 30, 2016 at 1:39 | history | edited | Maltysen | CC BY-SA 3.0 |
edited tags
|
Aug 30, 2016 at 1:36 | history | asked | Tim | CC BY-SA 3.0 |