As discussed in the comments to the question, it’s not very clear exactly what epitaph‘s setup is, and for some reason s/he seems unwilling to clarify. But let’s suppose that the “graph” is actually simply represented by a distance matrix (which may possibly be what the mess of numbers and Xs in the question is … Read more
Create an array of all your characters and then do a nested foreach loop to generate each possible combination. static void Main() { IList<char> characters = new List<char> {‘a’, ‘b’, ‘c’, ‘d’, ‘e’, ‘f’, ‘g’, ‘1’, ‘2’, ‘3’}; foreach (char c1 in characters) { foreach (char c2 in characters) { Console.WriteLine(new string(new[] {c1, c2})); } … Read more
The problem is actually like counting in base sizeof(set) on length k (assuming the set has 10 items maximum). For instance, with a set of { 0, 1, 2 } on length 2, you count from 00 to 22, base 3. To solve the “one digit change only” constraint, instead of counting increasingly, do that … Read more
In the 2×2 case you have 6 possible ways you say. (So I infer from that that you actually move from grid-point to grid-point rather than from cell to cell): (r,r,d,d), (r,d,r,d), (r,d,d,r), (d,r,d,r), (d,d,r,r), (d,r,r,d). Note that we always have 2 ‘d’s and 2 ‘r’s. And we always have 4 moves (_ , _, … Read more
For non zero partitions ( imagine boolean separators in array of 1) 2 ** (n-1) This list would include both 2 + 3 and 3 + 2. If you allow 0 then infinite. 11 solved Program that counts all the possible PARTS of a number [closed]
What is the total count of digits from 1 to N such that number of odd digits in the number is even and no of even digits are odd? solved What is the total count of digits from 1 to N such that number of odd digits in the number is even and no of … Read more