itertools.combinations()

Sort by

recency

|

902 Discussions

|

  • + 0 comments

    from itertools import combinations s,k=input().split() k1=int(k) s1=list(s) s1.sort() for i in range(0,k1): p=list(combinations(s1,i+1)) for i in p: j="".join(i) print(j)

  • + 0 comments

    from itertools import combinations

    l = list(input().split()) first = l[0] second = int(l[1]) first_sorted = sorted(l[0])

    for sizeof in range(1,second+1): new_list = list(combinations(first_sorted,sizeof)) for combo in new_list: print(''.join(combo))

  • + 0 comments

    from itertools import combinations

    s,n = input().split() s = sorted(s) n = int(n)

    for i in range(1,n+1): result = sorted(list(combinations(s,i))) for j in result: print(''.join(j))

  • + 0 comments
    1. from itertools import combinations
    2. x,y = input().split()
    3. y = int(y)
    4. a = list(x)
    5. a.sort()
    6. for i in range(1,y+1):
    7. p = list(combinations(a,i))
    8. for i in p:
    9. q = list(i)
    10. j="".join(q)
    11. print(j)
    12. 12.
  • + 0 comments
    from itertools import combinations
    
    if __name__ == '__main__':
        s, length = input().split()
        
        for i in range(1, int(length)+1):
            print('\n'.join([''.join(t) for t in combinations(sorted(s), i)]))