LightOJ-1342 Aladdin and the Magical Sticks

一类经典问题的变形：邮票收集问题https://en.wikipedia.org/wiki/Coupon_collector%27s_problem

1类棍子只会拿起一次，ans+=权值

2类棍子会拿起多次，ans+=权值*h[n]

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
const int N=5000+10;
double h[N];
int main()
{
	int T,kase=0;
	int n;
	scanf("%d",&T);
	h[0]=0.0;
	for(int i=1;i<N;i++)
		h[i]=h[i-1]+1.0/i;
	while(T--)
	{
		scanf("%d",&n);
		int a,b;
		double ans=0.0;
		for(int i=0;i<n;i++)
		{
			scanf("%d%d",&a,&b);
			if(b==1) ans+=a;
			else ans+=a*h[n];
		}
		printf("Case %d: %.6f\n",++kase,ans);
	}
	return 0;
}