StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
3379398
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2010-07-31T18:47:28.690
FavoriteCount
0
LastActivityDate
2010-07-31T18:47:28.690
LastEditDate
LastEditorUserId
0
OwnerUserId
336311
ParentId
3209360
PostTypeId
2
Score
1
ViewCount
0
LastEditorDisplayName
text
Body
These are some considerations about finding all combinations: First find all combinations to achive the larger of the two categories (A or B) by 1 or 2 items; it shall be easy to calculate the possible amounts of 1s and 2s and then to enumerate their positions (combinations I). 10 = 2+2+2+2+2 or 1+1+1+1+1+1+1+1+1+1 or 2+2+2+1+1+1+1 Then you can add the other categorie's amount. Each set of 2 is already full, each set of 1 may or may not get another one attached. Having all such combinations II (2 for each set of 1), you can calculate how many of the smaller category are missing. Eliminate such combinations II that include too many of the second category. Finally the amount of missing items in each combination II must be filled up - using 0/1 or 0/2 sets. This is the same problem as above. Due to smaller amounts, caching may increase performance here. So for each combination II you enumerate by the combinations for the missing items and finally have the combinations III you were looking for. Together: <ol> <li>Possible amounts of 1 (1/0) and 2 (2/0)-sets to achive the larger categorie's (e.g. A's) amount I. Systematic shuffling of the 1/0s and 2/0s II. Two possible combinations for each 1/0 -> 1/0 or 1/1 - and elimination of impossible combinations II III. Possible combinations for the missing amount of (e.g.) B's like in I</li> </ol> However, solving puzzles has not a lot to do with PHP. And regarding performance it depends a lot on the system on the amounts. Caching may increase performance for some combinations and decrease for others. And of course the algorith suggestes above has a lot of room for optimizations.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POChallenge to calculate maximum quantity and split sets with PHP
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USBurninLeo
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. This table or related slice is empty.
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. This table or related slice is empty.
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.