[UVA11427] Expect the Expected && 数学期望

用d[i][j]表示玩了i盘 赢了j盘 不高高兴兴去睡觉的概率

转移很好转移

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#include<cmath>
#define SF scanf
#define PF printf
using namespace std;
typedef long long LL;
const int MAXN = 100;
int n, k, m, kase;
double d[MAXN+10][MAXN+10];
int main()
{
	int T, kase = 1; for(SF("%d", &T); kase <= T; kase++) {
		int x, y;
		printf("Case #%d: ", kase);
		SF("%d/%d%d", &x, &y, &n);
		double p = 1.0 * x / y, ans = 0;
		d[1][0] = 1 - p;
		for(int i = 2; i <= n; i++)
			for(int j = 0; j < i; j++)
			{
				d[i][j] = d[i-1][j] * (1-p);
				if(j * y <= i * x && j)
					d[i][j] += d[i-1][j-1] * p;
			}
		for(int i = 0; i <= n; i++)
		{
			if(i * y > n * x) break;
			ans += d[n][i];
		}
		PF("%d\n", (int)(1 / ans));
	}
}