HDU2069 Coin Change (DP)

HDU2069 Coin Change (DP)

Question meaning:

 

Five coins for you:, 50. Now we give you an n to find the number of types that contain the value n, for example, n = 11;

1. 11 items 1

2. 1 10, 1 1

3, 1, 5, 6, 1

4, 2 5, 1 1

Note: The number of coins used cannot exceed 100. You only need to pay attention to this.

 

AC code:

 

/*** @ Xiaoran * dp [I], with a maximum of 100 coins */# include
 
  
# Include
  
   
# Include
   # Include
    
     
# Include
     
      
# Include
      
        # Include
       
         # Include
        
          # Include
         
           # Include
          
            # Include
           
             # Define LL long longusing namespace std; const int a [5] = {255, 101, 50}; LL dp [] []; // dp [j] [k]: Number of j Values consisting of k coins int main () {int n; while (cin> n) {// cout <