ACM-ICPC 2017 Asia Urumqi：A. Coins（DP）_they line up a row of nn identical coins-CSDN博客

本文链接：https://blog.csdn.net/Mitsuha_/article/details/79307065

Alice and Bob are playing a simple game. They line up a row of identical coins, all with the heads facing down onto the table and the tails upward.

For exactly times they select any of the coins and toss them into the air, replacing each of them either heads-up or heads-down with the same possibility. Their purpose is to gain as many coins heads-up as they can.

Input

The input has several test cases and the first line contains the integer $t (1 \leq t \leq 1000)$ which is the total number of cases.

For each case, a line contains three space-separated integers , $(1 \leq n, m \leq 100)$ and $(1 \leq k \leq n)$ .

Output

For each test case, output the expected number of coins heads-up which you could have at the end under the optimal strategy, as a real number with the precision of $3$ digits.

样例输入

样例输出

最优的策略一定是：当有至少 k 枚硬币面朝下时，则选 k 枚面朝下的硬币去抛掷（任意k 枚都可以）；如果不足 k 枚面朝下，则在选择所有面朝下的硬币的基础上再额外选择若干面朝上的银币。

于是有动态规划，记 F[i][j]表示抛掷了 i 次后，有 j 枚硬币面朝上的概率。他们应该满足F[i][0]+F[i][1]+...+F[i][n]=1。转移时，考虑从当前状态(i,j)出发，抛掷的 k 枚硬币的所有可能结果：分别有 0~k 枚面朝上。其中 k 枚硬币抛掷后有 l 枚面朝上的概率为 C(k,l)/2k。时间复杂度 O(nmk)。

#include<bits/stdc++.h>
using namespace std;
double d[200][200],p[200],c[200][200];
int main()
{
    c[0][0]=1;
    for(int i=1;i<=100;i++)
    {
        c[i][0]=1;
        for(int j=1;j<=i;j++)c[i][j]=c[i-1][j-1]+c[i-1][j];
    }
    p[0]=1;
    for(int i=1;i<=100;i++)p[i]=p[i-1]/2;
    int T;cin>>T;
    while(T--)
    {
        int n,m,t;
        scanf("%d%d%d",&n,&m,&t);
        memset(d,0,sizeof d);
        d[0][0]=1;
        for(int i=0;i<m;i++)
        {
            for(int j=0;j<=n;j++)
            {
                if(d[i][j]==0)continue;
                for(int k=0;k<=t;k++)
                {
                    if(n-j>=t)d[i+1][j+k]+=d[i][j]*c[t][k]*p[t];
                    else d[i+1][j-(t-(n-j))+k]+=d[i][j]*c[t][k]*p[t];
                }
            }
        }
        double ans=0;
        for(int i=1;i<=n;i++)ans+=d[m][i]*i;
        printf("%.3lf\n",ans);
    }
    return 0;
}