이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
# define int long long
const int maxn = 1e6 + 5;
void solve()
{
int n, k, cnt = 0;
cin >> n >> k;
vector < int > a(n);
multiset < int > st;
vector < int > dp(maxn, 0);
for(int i = 0; i < n; i++){
cin >> a[i];
}
dp[0] = 1;
for(int i = 0; i < n; i++)
{
for(int j = k; j >= 0; j--)
{
if(j - a[i] >= 0)
dp[j] += dp[j - a[i]];
}
}
for(int i = 0; i <= k; i++)
cnt += dp[i];
cout << cnt << endl;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tt = 1;
// cin >> tt;
while(tt--)
solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |