卡牌游戏(Card Game) 题解

思路分析

按题目要求使用对应数据结构与算法模拟/递推求解，注意数据范围边界与时间复杂度。

参考代码

#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, m;
    if (!(cin >> n >> m)) return 0;
    vector<int> cards(m);
    for (int i = 0; i < m; ++i) cin >> cards[i];

    // dp[i][j]: with i players left (indexed 0..i-1, dealer at 0), win prob of player j
    vector<vector<double>> dp(n + 1, vector<double>(n + 1, 0.0));
    dp[1][0] = 1.0;
    for (int i = 2; i <= n; ++i) {
        for (int c : cards) {
            int out = (c - 1) % i;
            for (int j = 0; j < i; ++j) {
                if (j == out) continue;
                int nxt_j = (j - out - 1 + i) % i;
                dp[i][j] += dp[i - 1][nxt_j] / m;
            }
        }
    }
    cout << fixed << setprecision(2);
    for (int j = 0; j < n; ++j) {
        cout << (dp[n][j] * 100.0) << "%" << (j + 1 == n ? "\n" : " ");
    }
    return 0;
}