Timeline for Calculate all possible distributions of n objects to k containers
Current License: CC BY-SA 3.0
21 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Oct 29, 2015 at 15:26 | history | bounty ended | IEatBagels | ||
| S Oct 29, 2015 at 15:26 | history | notice removed | IEatBagels | ||
| S Oct 28, 2015 at 15:18 | history | bounty started | IEatBagels | ||
| S Oct 28, 2015 at 15:18 | history | notice added | IEatBagels | Reward existing answer | |
| Oct 27, 2015 at 23:31 | history | tweeted | twitter.com/StackCodeReview/status/659150459924557824 | ||
| Oct 27, 2015 at 17:58 | vote | accept | jacobz | ||
| Oct 27, 2015 at 11:23 | answer | added | Gentian Kasa | timeline score: 4 | |
| Oct 27, 2015 at 6:58 | answer | added | mjolka | timeline score: 16 | |
| Oct 26, 2015 at 21:15 | comment | added | IEatBagels | I tried to find a mathematic function to solve your problem, but it's much more complicated than I thought :p If you ever want to see what I searched for, here's a link to my question | |
| Oct 26, 2015 at 19:24 | comment | added | 200_success | Related question from a couple of days ago | |
| Oct 26, 2015 at 19:22 | history | edited | 200_success |
edited tags
|
|
| Oct 26, 2015 at 18:28 | history | edited | Ethan Bierlein | CC BY-SA 3.0 |
deleted 5 characters in body
|
| Oct 26, 2015 at 16:56 | history | edited | IEatBagels | CC BY-SA 3.0 |
edited body
|
| Oct 26, 2015 at 15:58 | history | edited | Heslacher | CC BY-SA 3.0 |
3 bags vs k==5 at the very top
|
| Oct 26, 2015 at 15:55 | history | edited | jacobz | CC BY-SA 3.0 |
didn't know Code Review support latex :D
|
| Oct 26, 2015 at 15:50 | history | edited | jacobz | CC BY-SA 3.0 |
didn't know Code Review support latex :D; edited body
|
| Oct 26, 2015 at 15:39 | history | edited | Ethan Bierlein | CC BY-SA 3.0 |
added 64 characters in body
|
| Oct 26, 2015 at 15:34 | comment | added | jacobz | @TopinFrassi My primary goal is only the number of ways. When I first wrote my code, I stored all combinations in a list, but that is a bad idea, because you will eventually run out of memory if n/k/c get to high ;) | |
| Oct 26, 2015 at 15:30 | comment | added | IEatBagels | Cool question, I'd like to take a deeper look at it when I'll have time! Is your goal to output the number of ways or to output all the ways they can be stored? (Ex in that case, is the output 13 or the list of combinations)? | |
| Oct 26, 2015 at 14:22 | review | First posts | |||
| Oct 26, 2015 at 15:32 | |||||
| Oct 26, 2015 at 14:19 | history | asked | jacobz | CC BY-SA 3.0 |