combinations

问题 I have a problem I'm trying to solve in Java and I cannot figure out the algorithm that I'm going to need to follow. This problem is similar to the Bit String problem (how many bit strings are there of length x), but with some added difficulty. I'm not even sure the algorithm for solving the normal bit string problem anyway. So here's my actual problem: I have 5 variables. Say Q W X Y Z. Each variable can take one of 3 values (so like bit string can take 1 or 0, but this can take say 0, 1, or

问题 I've a vector of vectors say vector<vector<int> > items of different sizes like as follows 1,2,3 4,5 6,7,8 I want to create combinations in terms of Cartesian product of these vectors like 1,4,6 1,4,7 1,4,8 and so on till 3,5,8 How can I do that ? I've looked up several links and I've also listed them at the end of this post but I'm not able to interpret that as I'm not that familiar with the language. Could some body help me with this. #include <iostream> #include <iomanip> #include <vector>

问题 I'm not sure how to go about this in Python. In searching for this, I have come across itertools but I'm not sure how I might apply it in this case. What I am trying to do is create a script that can take a string input containing query marks (like AB?D?) and a set of options (ABC, DEF) to output all of the possible combinations, like below. ABADD, ABADE, ABADF ABBDD, ABBDE, ABBDF ABCDD, ABCDE, ABCDF In searching, I also found this but I'm not entirely sure how I might be able to implement

问题 I have a string in python and a dictionary of 'rules', or possible alterations to the string. For example, one rule might have a key of 'he' and a value of 'e' , or a key of 'll' and a value of 'l' . These rules would mean that any occurrence of ``'he' in my string can be replaced with an 'e' , and similarly for 'll' and 'l' . What I want is to find all variations of my string, given this dictionary of rules. For instance, with the two rules from above and the string 'hello' , I would like to

问题 I have combinations like this: 1,2,3,4 //index 0 1,2,3,5 //index 1 1,2,3,6 //index 2 and so on until 7,8,9,10 So this will be n=10 k=4 from combinatorics How calculate combination by index For example when my index==1 myCmb = func(index) returns 1,2,3,5 this is example i need this for bigest numbers, and for more params and without (if this possible) many loops i find something like this to obtain position: http://answers.yahoo.com/question/index?qid=20110320070039AA045ib I want now reverse

问题 I'm trying to do the following. I want to create a list of all possible relationships between certain things. For example. There's Mary, Alice, June, Cindy, Elizabeth, Betty, Jax I would like to create all possible combinations for a list like this: Mary, Alice Mary, June Mary Cindy Mary, Jax Mary, Alice, June Mary, Alice, Cindy Mary, Alice, Elizabeth ... Mary, Alice, Jax Mary, June, Cindy Mary, June, Elizabeth ... Mary, June, Jax Mary, Cindy, Elizabeth Mary, Cindy, Betty Mary, Cindy, Jax ...

问题 Question I'm trying to build a binary decision tree classifier in Python from scratch based on a data set that has only nominal attributes. One step I'm stuck on is finding all possible ways to compute a binary split of a nominal attribute. For example, for an attribute with possible values [a, b, c, d], I am looking for a way to split these in two arrays such that we obtain: left right ---- ----- a bcd b acd c abd d abc ab cd ac bd ad bc without duplicate splits (e.g. we don't need "bc" in

问题 (Re-posting, as I did not get any response to my previous post) I am trying to write a Python code to generate weak integer compositions (partitions) of a number 'n' into 'k' parts but with a MINIMUM and MAXIMUM value constraint on each partition (see example given below). Also, the partitions have to be generated in lexicographic order. I have found some related posts but have not been able to implement it. Any help will be appreciated. Example: Possible integer partitions for n=5 in k=3

问题 I have n elements in a set U (lets assume represented by an array of size n). I want to find all possible ways of dividing the set U into two sets A and B, where |A| + |B| = n. So for example, if U = {a,b,c,d}, the combinations would be: A = {a} -- B = {b,c,d} A = {b} -- B = {a,c,d} A = {c} -- B = {a,b,d} A = {d} -- B = {a,b,c} A = {a,b} -- B = {c,d} A = {a,c} -- B = {b,d} A = {a,d} -- B = {b,c} Note that the following two cases are considered equal and only one should be computed: Case 1: A

问题 I've scoured the entire website trying to look for a macro (or function) that will create unique combinations from a given list in adjacent columns. So basically, I have: A 1 F1 R1 B 2 F2 C F3 D E And I'm trying to list all the information as (in the same worksheet and in different columns): A 1 F1 R1 A 1 F2 R1 A 1 F3 R1 A 2 F1 R1 A 2 F2 R1 A 2 F3 R1 B 1 F1 R1 B 1 F2 R1 B 1 F3 R1 B 2 F1 R1 B 2 F2 R1 B 2 F3 R1 ...etc. (added bonus for being able to toggle where the list is printed on the sheet