HDU 2069 Coin Change functions

HDU 2069 Coin Change functions

HDU 2069 Coin Change functions

 

This question is a little more complex than a common primary function to solve the problem. The number of components is limited and the number of combinations cannot exceed 100 coins. Therefore, c1 and c2 are defined as two-dimensional arrays, c1 [I] [j] indicates c1 [Result] [number of results], and then a loop of traversal numbers is added.

 

 

// Solving the primary function # include

 
  
Using namespace std; const int MAX = 252; int ans [MAX] ={}; int c1 [MAX] [MAX], c2 [MAX] [MAX]; // c1 [coefficient] [Accumulative number] void getAns () {ans [0] = 1; const int t [] = {0, 1, 5, 10, 25, 50}; for (int n = 1; n

  
   
> N) {printf (% d, ans [n]);} return 0;