Codeforces 261B

暑期集训1 C题

传送门 http://codeforces.com/problemset/problem/261/B

 Maxim and Restaurant

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Maxim has opened his own restaurant! The restaurant has got a huge table, the table's length is p meters.

Maxim has got a dinner party tonight, n guests will come to him. Let's index the guests of Maxim's restaurant from 1 to n. Maxim knows the sizes of all guests that are going to come to him. The i-th guest's size (ai) represents the number of meters the guest is going to take up if he sits at the restaurant table.

Long before the dinner, the guests line up in a queue in front of the restaurant in some order. Then Maxim lets the guests in, one by one. Maxim stops letting the guests in when there is no place at the restaurant table for another guest in the queue. There is no place at the restaurant table for another guest in the queue, if the sum of sizes of all guests in the restaurant plus the size of this guest from the queue is larger than p. In this case, not to offend the guest who has no place at the table, Maxim doesn't let any other guest in the restaurant, even if one of the following guests in the queue would have fit in at the table.

Maxim is now wondering, what is the average number of visitors who have come to the restaurant for all possible n! orders of guests in the queue. Help Maxim, calculate this number.

Input

The first line contains integer n (1 ≤ n ≤ 50) — the number of guests in the restaurant. The next line contains integers a1, a2, ..., an(1 ≤ ai ≤ 50) — the guests' sizes in meters. The third line contains integer p (1 ≤ p ≤ 50) — the table's length in meters.

The numbers in the lines are separated by single spaces.

Output

In a single line print a real number — the answer to the problem. The answer will be considered correct, if the absolute or relative error doesn't exceed 10 - 4.

Examples

input

3
1 2 3
3

output

1.3333333333

题意：n个客人以某种队列去吃饭，每个客人有一个size(宽度？)，饭桌只能容纳下值为p宽度，所以客人们按队列一个个进入，直到进不去为止。

现在问n个客人以所有可能的排列方式排成队列去吃饭（即全排列），求n个客人每次所能进入人数的平均值。

题解：...因为是听的Duang神的解答...所以用的是n^4的做法，虽然时间上比不过n^3，不过思路简单易懂= =

用f[i][j][k]来表示前i个人进去了j个且此时宽度为k的组合个数，那么我们只要把所有的f[i][j][k]乘上j与n-j的阶乘以及此时人数(j)就可以表示出人数

但同时为了保证进去j个人之后，不会再进去新的人，所以枚举一个x表示此时x是前j个后的第一个并且x无法进去

那么求f[i][j][k]时便要注意不要加上a[x]

这样x,i,j,k四重循环算出总数最后除以n的阶乘即可

下面代码

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<stdlib.h>
#include<math.h>
#include<map>
#include<vector>
#include<set>
#include<queue>
using namespace std;

int a[55];
double f[55][55][55];
double jie[55];
double ans;

int main()
{
	int n,p,i,j,k,x,sum;
	
	scanf("%d",&n);
	sum=0;
	for(i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		sum+=a[i];
	}
	
	scanf("%d",&p);
	
	if(sum<=p) printf("%lf\n",(double)n);
	else
	{
		jie[0]=1;
		for(i=1;i<=50;i++)
			jie[i]=jie[i-1]*i;
	
		ans=0;
		
		for(x=1;x<=n;x++)
		{
			memset(f,0,sizeof(f));
			for(i=0;i<=n;i++)
				f[i][0][0]=1;
			for(i=1;i<=n;i++)
				{
					for(j=i;j>0;j--)
						for(k=0;k<=p;k++)
							f[i][j][k]=f[i-1][j][k];
					for(j=i;j>0;j--)
						for(k=0;k<=p;k++)
						{
							if(k>=a[i] && x!=i) f[i][j][k]+=f[i][j-1][k-a[i]];
						}
				}
			for(k=p;k>p-a[x];k--)
			{
				for(j=0;j<=n;j++)
				{
					ans+=f[n][j][k]*jie[j]*jie[n-j-1]*j;
				}
			}
		}
		ans=ans/jie[n];
		printf("%lf\n",ans);
	}
	return 0;
}