StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
4755949
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
2
CommunityOwnedDate
CreationDate
2011-01-21T06:13:14.150
FavoriteCount
0
LastActivityDate
2016-02-15T04:05:25.220
LastEditDate
2016-02-15T04:05:25.220
LastEditorUserId
540815
OwnerUserId
540815
ParentId
4647120
PostTypeId
2
Score
6
ViewCount
0
LastEditorDisplayName
text
Body
What you are attempting to list is called an k-multicombination. The problem is often stated this way: given n indistinguishable balls and k boxes, list all possible ways to distribute all of the balls in the boxes. The number of such distributions is: <pre><code>factorial(n + k - 1) / (factorial(k - 1) * factorial(n)) </code></pre> For further background, see Method 4 of the <a href="http://en.wikipedia.org/wiki/Twelvefold_way#Functions_from_N_to_X.2C_up_to_a_permutation_of_N" rel="nofollow noreferrer">Twelve-Fold Way</a>. Here is the code to enumerate the distributions (C++): <pre><code>string & ListMultisets(unsigned au4Boxes, unsigned au4Balls, string & strOut = string ( ), string strBuild = string ( )) { unsigned au4; if (au4Boxes > 1) for (au4 = 0; au4 <= au4Balls; au4++) { stringstream ss; ss << strBuild << (strBuild.size() == 0 ? "" : ",") << au4Balls - au4; ListMultisets (au4Boxes - 1, au4, strOut, ss.str ( )); } else { stringstream ss; ss << "(" << strBuild << (strBuild.size() == 0 ? "" : ",") << au4Balls << ")\n"; strOut += ss.str ( ); } return strOut; } int main(int argc, char * []) { cout << endl << ListMultisets (3, 5) << endl; return 0; } </code></pre> Here is the output from the above program (5 balls distributed over three boxes): <pre><code>(5,0,0) (4,1,0) (4,0,1) (3,2,0) (3,1,1) (3,0,2) (2,3,0) (2,2,1) (2,1,2) (2,0,3) (1,4,0) (1,3,1) (1,2,2) (1,1,3) (1,0,4) (0,5,0) (0,4,1) (0,3,2) (0,2,3) (0,1,4) (0,0,5) </code></pre>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. PONext Composition of n into k parts - does anyone have a working algorithm?
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USThomasMcLeod
UserOwnerUserId
1. USThomasMcLeod
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. PONext Composition of n into k parts - does anyone have a working algorithm?
 singulars
 PostTypePostTypeId
 PTQuestion
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
2. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTAcceptedByOriginator
3. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.