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.permutations()
  5. Discussions

itertools.permutations()

Sort by

recency

|

913 Discussions

|

  • grosvenordelaro1
     + 0 comments

    If you're stuck generating permutations, just sort the string first! Might even help with your lunchtime bonus prediction for today if you're mixing up options.

  • n94wdeepak
     + 0 comments
    from itertools import permutations
def permutation(string):
    combinations = list(permutations(string[0], int(string[1])))
    for i in sorted(combinations):
        print("".join(i))
				
if __name__ == '__main__':
    S = input().split()
    permutation(S)

  • luozhe2014
     + 0 comments

    from itertools import permutations

    s,n = input().split() n = int(n) result = sorted(list(permutations(s,n)))

    for i in result: print(''.join(i))

  • zhuyanzhao_js
     + 0 comments
    from itertools import permutations

if __name__ == '__main__':
    s, length = input().split()
    
    print('\n'.join([''.join(i) for i in permutations(sorted(s), int(length))]))

  • singhshrajan
     + 0 comments
    1. from itertools import permutations
      1. a,b = (input().upper()).split()
    3. b = int(b)
    4. a = "".join(sorted(a)) # return a string in lexicographic order
    5. ans = list(permutations(a,b))
    6. for i in ans:
    7. list(i)
    8. print("".join(i))