combinations

问题 I have a array $new_array=array('c','a','m','t','p'); Now I want to find the words combination which exists in the words table. I have tried to achieve but not succeeded. this is my php code . $words = array(); $set = powerSet($new_array,2); $mysql = new mysqli("localhost","root","","startup"); $sql = "SELECT wordid from words WHERE lemma = '%s'" ; foreach ($set as $key => $value) { $word = implode("", $value); $wordPermutation = permute($word); foreach($wordPermutation as $keyWord) { if(!in

问题 I was wondering if there is a function, or combination of functions (maybe it requires VBA) in Excel that will help me solve the following problem: There are 8 people in the group. I need to figure out and display all of the possible, non-repeating combinations created when 4 people are selected out of the 8. The order of the selected individuals isn’t important. I just need to find all of the unique combinations. For example: The 8 people are Bob, Carol, Ted, Alice, Reed, Sue, Johnny, Ben

问题 Given a string: String words = "Mary had a little lamb"; how to obtain a combination of sentence fragments while the order of occurrence of words in the original sentence is maintained ??? example: {'Mary had a little lamb'} {'Mary had a little', 'lamb'} {'Mary had a', 'little lamb'}, {'Mary had a', 'little', 'lamb'} {'Mary had', 'a little lamb'}, {'Mary had', 'a little', 'lamb'}, {'Mary had', 'a', 'little lamb'}, {'Mary had', 'a', 'little', 'lamb'} {'Mary', 'had a little lamb'}, {'Mary',

问题 I want to generate a lexicographic series of numbers such that for each number the sum of digits is a given constant. It is somewhat similar to 'subset sum problem'. For example if I wish to generate 4-digit numbers with sum = 3 then I have a series like: [3 0 0 0] [2 1 0 0] [2 0 1 0] [2 0 0 1] [1 2 0 0] ... and so on. I was able to do it successfully in Python with the following code: import numpy as np M = 4 # No. of digits N = 3 # Target sum a = np.zeros((1,M), int) b = np.zeros((1,M), int

问题 I want to generate a lexicographic series of numbers such that for each number the sum of digits is a given constant. It is somewhat similar to 'subset sum problem'. For example if I wish to generate 4-digit numbers with sum = 3 then I have a series like: [3 0 0 0] [2 1 0 0] [2 0 1 0] [2 0 0 1] [1 2 0 0] ... and so on. I was able to do it successfully in Python with the following code: import numpy as np M = 4 # No. of digits N = 3 # Target sum a = np.zeros((1,M), int) b = np.zeros((1,M), int

问题 I have an excel sheet with the below (pipe "|" to delimit columns) data. A|B|C|X|50|60 D|E|F|X|40|30 A|B|C|X|10|20 A|B|C|Y|20|20 A|B|C|X|20|70 D|E|F|X|10|50 A|B|C|Y|10|10 The result I am trying to get is: A|B|C|X|80|150 A|B|C|Y|30|30 D|E|F|X|50|80 Values A, B, C and D, E, F are like unique identifiers. Actually only A or D can be considered. Values X and Y are like "types", and the integers are the values to sum. This sample was simplified, there are thousands of unique identifiers, dozen of

问题 I need to generate all permutation of a string with selecting some of the elements. Like if my string is "abc" output would be { a,b,c,ab,ba,ac,ca,bc,cb,abc,acb,bac,bca,cab,cba }. I thought a basic algorithm in which I generate all possible combination of "abc" which are {a,b,c,ab,ac,bc,abc} and then permute all of them. So is there any efficient permutation algorithm by which I can generate all possible permutation with varying size. The code I wrote for this is : #include <iostream>

问题 I have multiple sets of arrays that contain additional arrays that have values attached that I use for figuring out math. In order to find the best combination of these things, I need to mix and match from these arrays. I've seen "solutions" similar to this around, but they're usually 1 array deep with no real combinations/possibilities. So to give an example. I have sets A, B, and C. Set A contains Aa, Ab, Ac, and Ad. Aa contains a set of values. Extrapolate that out for the others. Aa can

问题 I'm trying to write a function in R that, given a vector and a maximum size n, will return all the combinations of elements from that vector, up to size n. E.g.: multi_combn(LETTERS[1:3], 2) Would yield: [[1]] [1] "A" [[2]] [1] "B" [[3]] [1] "C" [[4]] [1] "A" "B" [[5]] [1] "A" "C" [[6]] [1] "B" "C" I've figured out an inelegant way to run combn for each size up to n, but I can't seem to combine the results into a single list. Any suggestions? 回答1: Try this: multi_combn <- function(dat, n) {

问题 I have a list of numbers like 1,2,3 and I want to find all the combination patterns that sum up to a particular number like 5. For example: Sum=5 Numbers:1,2,3 Patterns: 1 1 1 1 1 1 1 1 2 1 1 3 1 2 2 2 3 You're allowed to repeat numbers as far as they don't go over your sum. Which way would be best to program this? 回答1: This is a slight modification of the change making problem. You should be able to find plenty of papers on this problem, and a dynamic programming solution would take no more