题意:给一个n个面的骰子,每个面点数出现的概率相同,求扔出所有面的期望次数。
思路:设dp[i]为已经扔出了i个不同面值,还要扔dp[i]次才能扔出n个不同面的期望次数,显然dp[n] = 0,要求dp[0]
则dp[i] = 1+ i/n * dp[i] + (n-i)/n * dp[i+1],本来要扔的一次加上各个状态转移的期望值
=>dp[i] = n / (n-i) + dp[i+1]
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
double dp[100001];
int main () {
int t;
scanf ( "%d", &t );
for ( int cas = 1; cas <= t; cas++ ) {
memset ( dp, 0, sizeof ( dp ) );
int n;
scanf ( "%d", &n );
dp[n] = 0;
for ( int i = n - 1; i >= 0; i-- ) {
dp[i] = dp[i+1] + double(n)/double(n-i);
}
printf ( "Case %d: %lf\n", cas, dp[0] );
}
return 0;
}