题意:已知有n种红包,打开每种红包的概率都是1/n,求把n种红包全部打开所需次数的期望。(n<=30),结果保留最简分数或者整数。
分析:第一次一包,以后假设集齐了k张卡片,那么得到一张新卡片的概率是(n-k)/n,即平均需要n/(n-k)次才能得到一张新卡片.因此期望为
1+n/(n-1)+n/(n-2)+...+n=n(1+1/2+...+1/n)≈nlnn
代码:
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e7+10;
const ll p = 1e9+7;
ll s[N],n;
int main() {
cin>>n;
ll fz=1,fm=1;
for(ll i=2;i<=n;i++) {
ll tp=i*fm/__gcd(i,fm);
fz=tp/fm*fz+tp/i;
fm=tp;
}
fz*=n;
ll gd=__gcd(fz,fm);
fz/=gd,fm/=gd;
if(fm==1) cout<<fz<<endl;
else cout<<fz<<"/"<<fm<<endl;
return 0;
}