stirling

/*Stirling第一类数
#include<cstdio>
#define N 20
__int64 mul[N+1], a[N+1][N+1];

void Solve()
{
	mul[1] = 1;
	for(__int64 i = 2; i <= 20; i++)
		mul[i] = mul[i-1] * i;
	

	for(__int64 i = 0; i <= N; i++)
		a[i][0] = 0;
	for(__int64 i = 1; i <= N; i++)
	{
		for(__int64 j = 1; j <= i; j++)
		{
			if(i == j)
				a[i][j] = 1;
			else
				a[i][j] = a[i-1][j-1] + a[i-1][j] * (i-1);
		}
	}
}

int main()
{
	int t,n,k;
	scanf("%d",&t);
	Solve();
	while(t--)
	{
		scanf("%d%d",&n,&k);
		__int64 ans = 0;
		for(int i = 1; i <= k; i++)
			ans += a[n][i] - a[n-1][i-1];
		//printf("%I64d\n",ans);
		printf("%.4lf\n", 1.0*ans/mul[n]);
	}
	return 0;
}
*/