Advertisement
Guest User

Untitled

a guest
Apr 2nd, 2020
154
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.54 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. #define st first
  3. #define nd second
  4.  
  5. using  namespace std;
  6. using pii = pair<int, int>;
  7. using ll = long long;
  8. const  int N = 3e3 + 10;
  9. const int mod = 998244353;
  10. int dp[N];
  11. int add(int a, int b){
  12.     a += b;
  13.     a %= mod;
  14.     return a;
  15. }
  16. int main(){
  17.     int n, k, x, ans = 0;
  18.     scanf("%d %d",&n, &k);
  19.     dp[0] = 1;
  20.     for(int i =1; i <= n; i++){
  21.         scanf("%d", &x);
  22.         if(x <= k){
  23.             for(int j = k; j >= x; j--){
  24.                 dp[j] = add(dp[j], dp[j - x]);
  25.             }
  26.         }
  27.         dp[0]++;
  28.         ans = add(ans, dp[k]);
  29.     }
  30.     printf("%d", ans);
  31. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement