qp
by YPPAH @ 2023-12-04 17:09:04
qs，评黄有点过了些
by ___cjy__ @ 2023-12-04 17:10:07
资瓷
by zhangbinwoo @ 2023-12-04 17:11:36
没有吧，代码挺短的了。
by icypenguin @ 2023-12-04 17:12:06
@[bj12z_jiasiyuan](/user/751881) 原来是我蒟蒻了
by 张心博harry @ 2023-12-04 17:16:35
@[张心博harry](/user/547725) 跑一遍背包然后每次暴力删然后再加回来就行。
```cpp
#include <iostream>
#define ll long long
using namespace std;
ll n, m, dp[2005], a[2005];
int main(){
cin >> n >> m;
for (ll i = 1; i <= n; i++){
cin >> a[i];
}
dp[0] = 1;
for (ll i = 1; i <= n; i++){
for (ll j = m; j >= a[i]; j--){
dp[j] += dp[j - a[i]];
dp[j] %= 10;
}
}
for (ll i = 1; i <= n; i++){
for (ll j = a[i]; j <= m; j++){
dp[j] += 10;
dp[j] -= dp[j - a[i]];
dp[j] %= 10;
}
for (ll j = 1; j <= m; j++){
cout << dp[j];
}
cout << endl;
for (ll j = m; j >= a[i]; j--){
dp[j] += dp[j - a[i]];
dp[j] %= 10;
}
}
return 0;
}
```
by icypenguin @ 2023-12-04 17:21:34
@[bj12z_jiasiyuan](/user/751881) orz 谢谢
by 张心博harry @ 2023-12-04 17:34:39