1. You are given a number n, representing the count of coins.
2. You are given n numbers, representing the denominations of n coins.
3. You are given a number "amt".
4. You are required to calculate and print the combinations of the n coins (same coin can be used
again any number of times) using which the amount "amt" can be paid.
Note -> Use the code snippet and follow the algorithm discussed in question video. The judge can't
force you but the intention is to teach a concept. Play in spirit of the question.Input Format
A number n n1 n2 .. n number of elements A number amt
Output Format
Check the sample output and question video
Constraints
1 <= n <= 30 0 <= n1, n2, .. n elements <= 20 0 <= amt <= 50
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
5 2 3 5 6 7 12
Output
2-2-2-2-2-2-. 2-2-2-3-3-. 2-2-2-6-. 2-2-3-5-. 2-3-7-. 2-5-5-. 3-3-3-3-. 3-3-6-. 5-7-. 6-6-.