【SPOJ Favorite Dice】概率dp

SPOJ Favorite Dice
题意 有一个n面的骰子 问你所有面都扔到的期望次数是多少
这道题应该是自己的第一道期望dp
我们首先定义 $dp[i]$代表现在还差$i$种面数到n面
那么我们知道 dp[n] = 0 因为已经有$n$种面了
然后我们考虑 他有 $i/n$的概率扔到自己已经包含的
$$\left(dp\left[i\right]+\text{1*}\frac{i}{n}\right)$$
有$(n-i)/n$的概率扔到一个新的种类
新的种类就是要考虑到上个状态 $$\left(dp\left[i+1\right]+1\right)\ast \frac{n-i}{n}$$
$$\begin{gathered} dp\left[i\right]=\left(dp\left[i\right]+1\right)\ast \frac{i}{n}+\left(dp\left[i+1\right]+1\right)\ast \frac{n-i}{n}=dp\left[i\right]\ast \frac{i}{n}+dp\left[i+1\right]\ast \frac{n-i}{n} \\ \text{化简得到}dp\left[i\right]=dp\left[i+1\right]+\frac{n}{n-i} \end{gathered}$$

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
double dp[1025];
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        dp[n] = 0;
        for(int i = n-1;i>=0;--i)
            dp[i] = dp[i+1]+(1.0*n)/(1.0*(n-i));
        printf("%.2f\n",dp[0]);
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}