UVA - 10288 Coupons 概率与期望

/**
链接:https://vjudge.net/problem/UVA-10288
题意：一共存在n种不同的优惠券,每次得到优惠券的概率一样；
问期望多少次可以得到所有的n种优惠券,以分数的形式输出
分析:假设当前已经有k种优惠券,状态为几何分布,那么获得新的优惠券的概率就是(n-k)/n;
因此需要的步数的期望就是n/(n-k) 求和得到步数的期望n*segment 1/i  i-->(1,n);
注意输出格式即可;
*/

#include<bits/stdc++.h>
#define ll long long
using namespace std;

/**********************************************Head-----Template****************************************/
bool Finish_read;
template<class T>inline void read(T &x){Finish_read=0;x=0;int f=1;char ch=getchar();while(!isdigit(ch)){if(ch=='-')f=-1;if(ch==EOF)return;ch=getchar();}while(isdigit(ch))x=x*10+ch-'0',ch=getchar();x*=f;Finish_read=1;}
template<class T>inline void print(T x){if(x/10!=0)print(x/10);putchar(x%10+'0');}
template<class T>inline void writeln(T x){if(x<0)putchar('-');x=abs(x);print(x);putchar('\n');}
template<class T>inline void write(T x){if(x<0)putchar('-');x=abs(x);print(x);}
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
ll lcm(ll a,ll b){ll gg=gcd(a,b);a/=gg;if(a<=LLONG_MAX/b) return a*b;return LLONG_MAX;}
/********************************Head----Temlate**********************************************/

const int maxn=35;
ll Left[maxn],up[maxn],down[maxn];

void init(){
	memset(Left,0,sizeof(Left));
	memset(up,0,sizeof(up));
	memset(down,0,sizeof(down));
	Left[1]=1;
	for(int i=2;i<=33;i++){
		ll mo=1,de=1;
		for(int j=2;j<=i;j++){
			mo=mo*j+de;
			de*=j;
			ll tmp=gcd(mo,de);
			mo/=tmp;
			de/=tmp;
		}
		mo*=i;
		ll tmp=gcd(mo,de);
		mo/=tmp,de/=tmp;
		Left[i]=mo/de;
		up[i]=mo%de;
		down[i]=de;
	}
}

int main(){
	init();
	int n;
	int ans;
	while(~scanf("%d",&n)){
		if(up[n]==0) printf("%lld\n",Left[n]);
		else {
			for(ll i=Left[n];i>0;i/=10) printf(" ");
			printf(" %lld\n",up[n]);
			printf("%lld ",Left[n]);
			for(ll i=down[n];i>0;i/=10) printf("-");
			printf("\n");
			for(ll i=Left[n];i>0;i/=10) printf(" ");
			printf(" %lld\n",down[n]);
		}
	}
	return 0;
}