【SGU 495 Kids and Prizes】

SGU 495
题意 一共有n个礼物 m个人来取 取完礼物的人会把空盒子放在原位置 问m个人取完后他们获得的礼物期望是多少
我们设$dp[i]$表示第$i$个人取得礼物的概率
那么$dp[1]=1$ 我们对$dp[i]$分析 他这次没取到礼物的概率和$dp[i-1]$相同 所以概率为$1-dp[i-1]$取到礼物的概率是$(dp[i-1]-1.0/n)$那么$dp[i]=dp[i-1]\ast (1-dp[i-1]+dp[i-1]-1.0/n)=dp[i-1]\ast (1-1.0/n)$

/*
    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);
const int MAX_N = 1000025;
double p[MAX_N];
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,m;scanf("%d%d",&n,&m);
    double ans = 0;
    p[1] =1;
    for(int i = 2;i<=m;++i)
        p[i] = (1-p[i-1])*p[i-1]+p[i-1]*(p[i-1]-1.0/n);
    for(int i = 1;i<=m;++i) ans+=p[i];
    printf("%.9f\n",ans);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}