← 查看本卷题目
组合题6 个小题
已作答 0 / 6
#include <iostream>#include <string>using namespace std; const int P = 998244353, N = 1e4 + 10, M = 20;int n, m;string s;int dp[1 << M]; int solve() {    dp[0] = 1;    for (int i = 0; i < n; ++i) {        for (int j = (1 << (m - 1)) - 1; j >= 0; --j) {            int k = (j << 1) | (s[i] - '0');            if (j != 0 || s[i] == '1')                dp[k] = (dp[k] + dp[j]) % P;        }    }    int ans = 0;    for (int i = 0; i < (1 << m); ++i) {        ans = (ans + 1ll * i * dp[i]) % P;    }    return ans;} int solve2() {    int ans = 0;    for (int i = 0; i < (1 << n); ++i) {        int cnt = 0;        int num = 0;        for (int j = 0; j < n; ++j) {            if (i & (1 << j)) {                num = num * 2 + (s[j] - '0');                cnt++;            }        }        if (cnt <= m) (ans += num) %= P;    }    return ans;} int main() {    cin >> n >> m;    cin >> s;    if (n <= 20) {        cout << solve2() << endl;    }    cout << solve() << endl;    return 0;} 

假设输入的 ss 是包含 nn 个字符的 0101 串,完成下面的判断题和单选题。

第24题单选题原卷 3 分

当 n=10n = 10 且 m=10m = 10 时,有多少种输入使得两行的结果完全一致?( )

填写答案