This code should do the work: bytes = [i for i in range(2**(n))] AB= [] for obj in bytes: t = str(bin(obj))[2:] t=”0″*(n-len(t)) + t AB.append(t.replace(‘0′,’A’).replace(‘1′,’B’)) n being the string size wanted solved The Concept Behind itertools’s product Function
itertools.izip_longest takes an optional fillvalue argument that provides the value that is used after the shorter list has been exhausted. fillvalue defaults to None, giving the behaviour you show in your question, but you can specify a different value to get the behaviour you want: fill = a[-1] if (len(a) < len(b)) else b[-1] for … Read more
There is not (much) difference between def chain_for(*a): and def __init__(self, *a):. Hence, a very crude way to implement this can be: class chain_for: def __init__(self, *lists): self.lists = iter(lists) self.c = iter(next(self.lists)) def __iter__(self): while True: try: yield next(self.c) except StopIteration: try: self.c = iter(next(self.lists)) except StopIteration: break yield next(self.c) chain = chain_for([1, 2], … Read more
Assuming you mean itertools.product (it looks like it from the example given): public static List< Tuple<T, T> > Product<T>(List<T> a, List<T> b) where T : struct { List<Tuple<T, T>> result = new List<Tuple<T, T>>(); foreach(T t1 in a) { foreach(T t2 in b) result.Add(Tuple.Create<T, T>(t1, t2)); } return result; } n.b. struct here means that … Read more
as far as the error is concerned print(list1[random].randint(1,length)) should be changed to print(list1[random.randint(1,length)]) 2 solved How do I use permutation to find all possible words from an input? [closed]