YEZAELP

CUBE-048: ร้านสะดวกซื้อ (Convenience Store)

Jun 19th, 2020
126
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.48 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. const int N=1e6+7;
  4. int main(){
  5.     int n,k;
  6.     scanf("%d%d",&n,&k);
  7.     int dp2[50001],dp1[50001];
  8.     for(int i=1;i<=n;i++){
  9.         int x;
  10.         scanf("%d",&x);
  11.         dp1[k]=1;
  12.         for(int j=k-1;j>=0;j--){
  13.             if(j+x<=k) dp2[j]=dp1[j+x]+dp1[j];
  14.             else dp2[j]=dp1[j];
  15.             dp2[j]=dp2[j]%N;
  16.         }
  17.         for(int j=0;j<=k;j++) dp1[j]=dp2[j];
  18.     }
  19.     printf("%d",dp2[0]);
  20.  
  21.     return 0;
  22. }
Add Comment
Please, Sign In to add comment