#include
using namespace std;
const int MAXN = 2005;
const double eps = 1e-10;
int n, m, k; double p1, p2, p3, p4;
double dp[2][MAXN], c[MAXN], pp[MAXN];
int main() {
while(~scanf("%d%d%d%lf%lf%lf%lf", &n, &m, &k, &p1, &p2, &p3, &p4)) {
if(p4 double p = p2 / (1 - p1);
double p31 = p3 / (1 - p1);
double p41 = p4 / (1 - p1);
pp[0] = 1;
for(int i = 1; i int now = 0;
dp[now][1] = p41 / (1 - p);
c[1] = p41;
for(int i = 2; i now ^= 1;
for(int j = 2; j for(int j = k+1; j double tmp = 0;
for(int j = 1; j dp[now][i] = tmp / (1 - pp[i]);
dp[now][1] = p * dp[now][i] + c[1];
for(int j = 2; j }
printf("%.5fn", dp[now][m]);
}
}
/*
j==1: dp[i][1]=p*dp[i][i]+p41;
2k
dp[i][j] = dp[i][j-1] * p + c[j]
*/
服务器托管,北京服务器托管,服务器租用,机房机柜带宽租用
咨询:董先生
电话13051898268 QQ/微信93663045!
上一篇: 「ZJOI2014」力 FFT
下一篇: Time travel HDU – 4418 (概率DP)