UESTC 1721 Wu Shen, human hope (combined count)

Reprinted please indicate the source, thank youHttp://blog.csdn.net/acm_cxlove/article/details/7854526
By --- cxlove

Question: Put N items in M identical boxes. Each box contains at least K items.

Http://acm.uestc.edu.cn/problem.php? PID = 1, 1721

Recently, I was abused and asked a question.

Enumerate m and then put K items in each box first. For the remaining N-M * k items, put them in M boxes, which can be empty.

DP [I] [J] indicates the type in which I items are placed in J boxes. It cannot be empty. You only need to add m items to ensure at least one item.

 # include 
  
    # include 
   
     # include 
    
      # include 
     
       # include 
      
        # include 
       
         # include 
        
          # include 
         
           # include 
           # include 
           
             # define maxn 200005 # define EPS 1e-8 # define INF 1 <30 # define ll long # define zero () FABS (a)