itertools.combinations_with_replacement() HackerRank Solution in Python

itertools.combinations_with_replacement(iterable, r)

This tool returns r length subsequences of elements from the input iterable allowing individual elements to be repeated more than once.

Combinations are emitted in lexicographically sorted order. So, if the input iterable is sorted, the combination tuples will be produced in sorted order.

Sample Code

>>> from itertools import combinations_with_replacement

>>> 

>>> print list(combinations_with_replacement('12345',2))

[('1', '1'), ('1', '2'), ('1', '3'), ('1', '4'), ('1', '5'), ('2', '2'), ('2', '3'), ('2', '4'), ('2', '5'), ('3', '3'), ('3', '4'), ('3', '5'), ('4', '4'), ('4', '5'), ('5', '5')]

>>> 

>>> A = [1,1,3,3,3]

>>> print list(combinations(A,2))

[(1, 1), (1, 3), (1, 3), (1, 3), (1, 3), (1, 3), (1, 3), (3, 3), (3, 3), (3, 3)]

Task

You are given a string S.

Your task is to print all possible size K  replacement combinations of the string in lexicographic sorted order.

Input Format

A single line containing the string S and integer value k is separated by a space.

Constraints

The string contains only UPPERCASE characters.

Output Format

Print the combinations with their replacements of string S on separate lines.

Sample Input

HACK 2

Sample Output

AA

AC

AH

AK

CC

CH

CK

HH

HK

KK

Solution

1
2
3
4
5

# Enter your code here. Read input from STDIN. Print output to STDOUT

from itertools import combinations_with_replacement
s, n = input().split()
print(*[''.join(i) for i in combinations_with_replacement(sorted(s), int(n))], sep="\n")