query: Python Fundamental Counting Principle Possible Permutations
positive_passages.docid: 1058
positive_passages.text: Get the cartesian product of a series of lists?
negative_passages.docid: 98744
negative_passages.text: How to distinguish between permutation and combination questions?
negative_passages.docid: 105055
negative_passages.text: How can I find all of the permutations consisting of 1 element from a variable number of arrays of variable length?
negative_passages.docid: 130291
negative_passages.text: Shortest sequence containing all permutations
negative_passages.docid: 83837
negative_passages.text: Odd/Even Permutations
negative_passages.docid: 107964
negative_passages.text: Simple combinatorics problem.
negative_passages.docid: 127210
negative_passages.text: Is there any pre-built method for finding all permutations of a given string in JavaScript?
negative_passages.docid: 75804
negative_passages.text: Is this permutation-sum problem NP-complete?
negative_passages.docid: 114752
negative_passages.text: Number of permutations of a specific cycle decomposition
negative_passages.docid: 122504
negative_passages.text: Factorisations of permutations
negative_passages.docid: 101719
negative_passages.text: Finding the n-th lexicographic permutation of a string
negative_passages.docid: 58103
negative_passages.text: number of permutations in which no two consecutive numbers are adjacent
negative_passages.docid: 158580
negative_passages.text: Permutation count of AABBC
negative_passages.docid: 97254
negative_passages.text: What is the proof of permutations of similar objects?
negative_passages.docid: 115934
negative_passages.text: What is the parity of permutation in the 15 puzzle?
negative_passages.docid: 27610
negative_passages.text: Given the permutation $\sigma=\left(\begin{array}{ccccc} 1&2&3&4&5\\ 3&1&2&5&4 \end{array}\right)$
negative_passages.docid: 70515
negative_passages.text: Recursion and Counting