fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. int consistency(int n, int m, int x){
  33. if(n==1 && x == 1) return 1;
  34. if(n==1 && x != 1) return 0;
  35.  
  36. vector<vector<int>> dp(n+1, vector<int>(x+1, 0));
  37.  
  38. dp[0][0] = 1;
  39. dp[1][1] = 1;
  40.  
  41.  
  42. for(int i=2; i<=n; i++){
  43.  
  44. for(int k=1; k<=x; k++){
  45.  
  46. int j = i-1;
  47. int sum = a[i];
  48. while(j>=0 && sum <= m ){
  49. dp[i][k] += dp[j][k-1];
  50.  
  51. sum += a[j];
  52. j--;
  53. }
  54. }
  55. }
  56.  
  57. return dp[n][x];
  58. }
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74. int practice(int n, int m, int k){
  75.  
  76.  
  77. return 0;
  78. }
  79.  
  80.  
  81.  
  82.  
  83.  
  84. void solve() {
  85.  
  86. int n, m, k;
  87. cin >> n >> m >> k;
  88.  
  89. a.resize(n+1);
  90. for(int i=1; i<=n; i++) cin >> a[i];
  91.  
  92. cout << consistency(n, m, k) << endl;
  93.  
  94.  
  95. }
  96.  
  97.  
  98.  
  99.  
  100.  
  101. int32_t main() {
  102. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  103.  
  104. int t = 1;
  105. // cin >> t;
  106. while (t--) {
  107. solve();
  108. }
  109.  
  110. return 0;
  111. }
Success #stdin #stdout 0s 5324KB
stdin
5 5 4
1 2 3 4 4 
stdout
2