解题思路
推出结论
1234 % 9 == (1 + 4 + 3 + 2 ) % 9
这题用01背包的解法
#include"bits/stdc++.h"
#define ll long long
#define pi pair<int,int>
#define inf 0x3f3f3f3f
#define _for(i,a,b) for(int i=a;i<=b;i++)
#define for_(i,a,b) for(int i=a;i<b;i++)
#define _fr(i,a,b) for(int i=a;i>=b;i--)
#define fr_(i,a,b) for(int i=a;i>b;i--)
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
const int N = 1e5+5;
const ll mod = 998244353;
const double lp=1.000000011;
map<string,int>mp;
int dp[N][9];
void solve(){
int n,x;
cin >> n;
dp[0][0]=1;
_for(i,1,n){
cin >> x;
x%=9;
_for(j,0,8){
dp[i][(j+x)%9] = (dp[i][(j+x)%9] + dp[i-1][j])%mod;
dp[i][j] = (dp[i][j] + dp[i-1][j])%mod;
}
}
_for(i,1,8) cout << dp[n][i] << " " ; cout << dp[n][0]-1 << endl;
}
int main() {
solve();
return 0;
}