给定接下来的轮次以及最低获得的积分,否则教练就会下课。刚开始推了很久的公式,觉得加起来项数好多,好烦。后来突然想到直接就是一个dp问题,按照上次的积分扫就可以,最后输出N轮时得分大于P分的总和概率即可
// Problem#: 1570
// Submission#: 3307174
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
double dp[105][405];
int main() {
int N, P; // N轮数,P分数
while (scanf("%d%d", &N, &P) && N + P) { // 判断条件需要注意,N&&P是不行的(难道接下来可以得0分- -或者0轮么...这还搞毛)
int w, d, l, total;
scanf("%d%d%d", &w, &d, &l);
total = w + d + l;
double win, draw, lose;
win = (double)w / (double)total;
draw = (double)d / (double)total;
lose = (double)l / (double)total;
dp[0][0] = 1.0; // dp[i][j]表示第i轮后,得到j分
for (int i = 1; i <= N; i++) {
for (int j = 0; j <= 3 * i; j++) {
dp[i][j] += dp[i - 1][j] * lose; // 此局输了
dp[i][j + 1] += dp[i - 1][j] * draw; // 平了
dp[i][j + 3] += dp[i - 1][j] * win; // 赢了
}
}
double sum = 0;
for (int i = P; i <= 3 * N; i++) { // 符合条件的概率全部累加就行了
sum += dp[N][i];
}
printf("%.1lf\n", sum * 100.0);
memset(dp, 0, sizeof(dp));
}
}