-
Notifications
You must be signed in to change notification settings - Fork 0
/
minCoins.cpp
77 lines (63 loc) · 1.26 KB
/
minCoins.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
//coin change dp approach
#include<iostream>
#include<cstdlib>
#define ll long long int
using namespace std;
ll minCoin(ll arr[],ll n,ll N)
{
ll **tab= new ll * [n + 1];
for(ll i = 0; i <= n ; i++ )
tab[i] = new ll [N + 1];
ll r , q;
for(ll i = 0 ; i <= n ; i++)
tab[i][0] = 0;
for(ll i = 0 ; i <= N ; i++)
tab[0][i] = 0;
for(ll i = 1 ; i <= n ; i++)
{
for(ll j = 1 ; j <= N ; j++)
{
if(arr[i - 1] > j )
{
tab[i][j] = tab[i - 1][j];
}
else
{
q = (j / arr[i - 1]);
r = tab[i][j % arr[i - 1]];
if(!(j % arr[i - 1]) || r)
tab[i][j]= r + q;
else
tab[i][j] = 0;
}
}
}
for(int i = 0 ; i <= n ; i++)
{
for( int j = 0 ; j <= N ; j++)
{
cout<<tab[i][j]<<" ";
}
cout<<endl;
}
return tab[n][N];
}
int main()
{
ll t;
cin>>t;
while(t--)
{
ll n,N;
cin>>n>>N;
ll arr[n];
for(ll i = 0 ; i < n ; i++)
cin>>arr[i];
ll result = minCoin(arr,n,N);
if(result)
cout<<result<<endl;
else
cout<<"-1"<<endl;
}
return 0;
}