New update is available. Click here to update.

Posted: 27 Jul, 2020

Difficulty: Moderate

```
The first line of input contains an integer N, representing the total number of denominations.
The second line of input contains N integers values separated by a single space. Each integer value represents the denomination value.
The third line of input contains the value of V, representing the value for which the change needs to be generated.
```

```
For each test case, print an integer denoting the total number of ways W, in which a change for V is possible.
```

```
You do not need to print anything, it has already been taken care of. Just implement the given function.
```

```
1 <= N <= 10
1 <= D[i] <=10^5
1 <= V <= 2 * 10^3
Where 'D[i]' represent the value of ith denomination.
Time Limit: 1sec
```

Popular Interview Problems: