We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Python
  3. Itertools
  4. itertools.combinations()
  5. Discussions

itertools.combinations()

Sort by

recency

|

901 Discussions

|

  • kunwarabhikeern1
     + 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))

  • luozhe2014
     + 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))

  • singhshrajan
     + 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.

  • zhuyanzhao_js
     + 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)]))

  • kcmutya
     + 0 comments
    # Enter your code here. Read input from STDIN. Print output to STDOUT
from itertools import combinations

S = input().split()
for i in range(1,int(S[1])+1):
    for l in combinations(sorted(S[0].upper()), i):
        print(''.join(l))