Timeline for Choose from an existing set of weights to make a target sum
Current License: CC BY-SA 3.0
30 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 1, 2018 at 21:34 | vote | accept | anatolyg | ||
| Jul 3, 2016 at 23:03 | history | tweeted | twitter.com/StackCodeGolf/status/749740494842978304 | ||
| Jun 30, 2016 at 8:54 | answer | added | Neil | timeline score: 1 | |
| Jun 30, 2016 at 8:33 | answer | added | lstefano | timeline score: 1 | |
| Jun 30, 2016 at 7:27 | comment | added | Peter Taylor | @LuisMendo, each person only gets one close vote per question. | |
| Jun 30, 2016 at 5:04 | answer | added | ejaszewski | timeline score: 1 | |
| Jun 29, 2016 at 21:50 | comment | added | Luis Mendo | @PeterTaylor Feel free to mark as dupe again then. I only intended to cast a vote | |
| Jun 29, 2016 at 21:42 | comment | added | Peter Taylor | @LuisMendo, the symmetry restriction is irrelevant: it just reduces to having 3 pairs of weight 2kg, 3 pairs of 5kg, etc. As for the "all subsets" difference, there are a few other questions which this is a more direct dupe of which have also been closed as a dupe of that one, and I preferred to cut out the middleman. | |
| Jun 29, 2016 at 21:36 | comment | added | Luis Mendo | I don't think the linked challenge is a duplicate. That one asks to find all subsets with any number of elements, and doesn't have the symmetry restriction. I didn't realized my dupe-hammer worked the way around too, though. I only intented to vote to reopen and gather more opinions @PeterTaylor | |
| Jun 29, 2016 at 21:36 | history | reopened |
anatolyg Luis Mendo code-golf Users with the code-golf badge or a synonym can single-handedly close code-golf questions as duplicates and reopen them as needed. |
||
| Jun 29, 2016 at 21:20 | review | Reopen votes | |||
| Jun 29, 2016 at 21:40 | |||||
| Jun 29, 2016 at 19:11 | history | closed | Peter Taylor code-golf Users with the code-golf badge or a synonym can single-handedly close code-golf questions as duplicates and reopen them as needed. | Duplicate of Golf the Subset-Sum Problem | |
| Jun 29, 2016 at 19:09 | answer | added | Fatalize | timeline score: 2 | |
| Jun 29, 2016 at 18:06 | answer | added | TheBikingViking | timeline score: 3 | |
| Jun 29, 2016 at 17:15 | history | edited | anatolyg | CC BY-SA 3.0 |
edited body
|
| Jun 29, 2016 at 17:04 | answer | added | Dennis | timeline score: 5 | |
| Jun 29, 2016 at 16:50 | comment | added | anatolyg | @busukxuan No - it must work for any number. But in certain languages (e.g. C) you can limit the range at 127, using this guideline. Also, if it fails in a different way for 28 and 122 - it's good enough, as long as it does fail. | |
| Jun 29, 2016 at 16:23 | comment | added | busukxuan | Can we assume all input to be less than 122? | |
| Jun 29, 2016 at 15:48 | answer | added | Luis Mendo | timeline score: 6 | |
| Jun 29, 2016 at 15:45 | history | edited | anatolyg | CC BY-SA 3.0 |
added 130 characters in body
|
| Jun 29, 2016 at 15:42 | comment | added | anatolyg | No, you should choose one. I'll add a clarification. | |
| Jun 29, 2016 at 15:41 | comment | added | Luis Mendo | Can we output all solutions instead of just one? | |
| Jun 29, 2016 at 15:38 | comment | added | FryAmTheEggman | Yes, the reason I posted was that I was unsure that the modification was significant enough. I posted to try to get community feedback, and I'll remove my comment if it seems like the community disagrees with me. | |
| Jun 29, 2016 at 15:35 | answer | added | lynn | timeline score: 4 | |
| Jun 29, 2016 at 15:28 | comment | added | AdmBorkBork | Related, but that one is ASCII | |
| Jun 29, 2016 at 15:27 | comment | added | anatolyg | The greedy algorithm doesn't work (not without modification, at least) exactly because the numbers are limited | |
| Jun 29, 2016 at 15:24 | answer | added | LegionMammal978 | timeline score: 5 | |
| Jun 29, 2016 at 15:19 | comment | added | FryAmTheEggman | Isn't this a dupe of the minimum coin counting question? I don't think the same greedy algorithm fails, except with the restriction of 6 of one kind of plate. I think that might not be sufficient difference, but I'm not sure. | |
| Jun 29, 2016 at 15:17 | answer | added | Leaky Nun | timeline score: 1 | |
| Jun 29, 2016 at 15:11 | history | asked | anatolyg | CC BY-SA 3.0 |