StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

POHow to solve this weird multiple loops scenario (Java or C#)?
primarykey
Id
9015711
data
AcceptedAnswerId
9016654
AnswerCount
3
ClosedDate
CommentCount
33
CommunityOwnedDate
CreationDate
2012-01-26T08:54:14.820
FavoriteCount
1
LastActivityDate
2012-01-26T14:03:23.223
LastEditDate
2012-01-26T09:36:14.473
LastEditorUserId
66607
OwnerUserId
66607
ParentId
0
PostTypeId
1
Score
1
ViewCount
523
LastEditorDisplayName
text
Body
I've got this - possibly trivial - loop/combinations problem similar to binary combinations. I don't know how to approach it efficiently. Consider this scenario, I need unique loop to pass through all these combinations in a sequence: <pre><code>Round ABC 01. 000 <- values of A=0, B=0, C=0 02. 001 03. 010 04. 011 05. 100 06. 101 07. 110 08. 111 09. 002 10. 012 11. 102 12. 112 13. 020 14. 021 15. 120 16. 121 <- values of A=1, B=2, C=1 17. 022 18. 122 19. 220 20. 221 21. 222 </code></pre> Except there are 12 letters (A-L), and also the "bit" size is not just 0,1 or 2 but any integer number (from 0 possibly up-to 1000 or 1024, not to make it crazy). I know it's a huge load of combinations, but I'll just scrap just top few that also fulfill my other conditions. So no need to worry about computational madness. Disclaimer: The order has to be exactly as shown above. NOT a multiple FOR loops going first 0-1024 for C, then B. Thanks in advance, I just can't seem to find the way to "algorithm it". Update: Added whole sequence for combinations of ABC/012 regards, Kate Explanation: I've encountered this problem when trying to tackle problem of analyzing sum of money for its combination of coins/notes: For example $5001 to find out x optimal combinations. <pre><code>10x $500 + 1x $1 50x $100 + 1x $1 .. </code></pre> Now letters (A,B,C..) correspond to a number of possible values of banknotes or coins ($1, $5,.. $100). While base correspond to a number of pieces of that banknotes/coins (for example $5001/$5000 = 1piece max.)
Tags
<c#><java><algorithm><for-loop><binary>
Title
How to solve this weird multiple loops scenario (Java or C#)?
singulars
PostAcceptedAnswerId
1. PO
 singulars
 PostTypePostTypeId
 PTAnswer
PostParentId
1. This table or related slice is empty.
PostTypePostTypeId
1. PTQuestion
UserLastEditorUserId
1. USSmartK8
UserOwnerUserId
1. USSmartK8
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. PO
 singulars
 PostTypePostTypeId
 PTAnswer
2. PO
 singulars
 PostTypePostTypeId
 PTAnswer
3. PO
 singulars
 PostTypePostTypeId
 PTAnswer
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 POHow to solve this weird multiple loops scenario (Java or C#)?
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTModeratorReview
2. VO
 singulars
 PostPostId
 POHow to solve this weird multiple loops scenario (Java or C#)?
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTUpMod
3. VO
 singulars
 PostPostId
 POHow to solve this weird multiple loops scenario (Java or C#)?
 UserUserId
 USpathikrit
 VoteTypeVoteTypeId
 VTFavorite
CommentsPostId

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.