HackerRank-/DPCoinChange.cpp at master · AndresFelipeRG/HackerRank- · GitHub

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
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

long long make_change(vector<int> coins, int money, int maxi, vector<vector<vector<long long>>> * sol) {

    if(coins.size() == 0 ){return 0;}
    //cout << money <<","<<maxi<<endl;
    if((*sol)[maxi][money][1] == 1){return (*sol)[maxi][money][0];}
    if(money == 0){(*sol)[maxi][0][0] = 1; return 1;}

    long long ways = 0;
    int i = 0;
    while(i < coins.size() && coins[i] <= money && coins[i] <= maxi){


        ways = ways + make_change(coins, money-coins[i], coins[i], sol);


        i++;
    }

    (*sol)[maxi][money][0] = ways;
    (*sol)[maxi][money][1] = 1;

    return ways;

}

int main(){
    int n;
    int m;
    cin >> n >> m;
    vector<int> coins(m);

    for(int coins_i = 0;coins_i < m;coins_i++){
       cin >> coins[coins_i];
    }
    if(n != 0){
    sort(coins.begin(), coins.end());
    vector<long long> sec(2,-1);
    vector<vector<long long>> pair(n+1, sec);
    vector<vector<vector<long long>>> sol(n+1, pair);

    cout << make_change(coins, n,n, &sol) << endl;

    }
    else{
    cout << 0;
    }
    return 0;
}