Submission #870247

#TimeUsernameProblemLanguageResultExecution timeMemory
870247vjudge1Ice Hockey World Championship (CEOI15_bobek)C++17
50 / 100
98 ms300204 KiB
#include <iostream> #include <vector> #define int long long using namespace std; signed main() { int n, m, res = 0; cin >> n >> m; vector<int> a(n); vector<vector<int>> dp(n+1, vector<int>(m+1)); for(int i = 0; i < n; i++) cin >> a[i]; dp[0][0] = 1; for(int i = 1; i <= n; i++) { for(int j = 0; j <= m; j++) { dp[i][j] = dp[i-1][j]+(j>=a[i-1] ? dp[i-1][j-a[i-1]] : 0); //cout << dp[i][j] << " "; } //cout << "\n"; } for(int i = 0; i <= m; i++) res+=dp[n][i]; cout << res << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...