codeforces626D . Jerry's Protest

Andrew and Jerry are playing a game with Harry as the scorekeeper. The game consists of three rounds. In each round, Andrew and Jerry draw randomly without replacement from a jar containing n balls, each labeled with a distinct positive integer. Without looking, they hand their balls to Harry, who awards the point to the player with the larger number and returns the balls to the jar. The winner of the game is the one who wins at least two of the three rounds.

Andrew wins rounds 1 and 2 while Jerry wins round 3, so Andrew wins the game. However, Jerry is unhappy with this system, claiming that he will often lose the match despite having the higher overall total. What is the probability that the sum of the three balls Jerry drew is strictly higher than the sum of the three balls Andrew drew?

Input

The first line of input contains a single integer n (2 ≤ n ≤ 2000) — the number of balls in the jar.

The second line contains n integers ai (1 ≤ ai ≤ 5000) — the number written on the ith ball. It is guaranteed that no two balls have the same number.

Output

Print a single real value — the probability that Jerry has a higher total, given that Andrew wins the first two rounds and Jerry wins the third. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.

Namely: let's assume that your answer is a, and the answer of the jury is b. The checker program will consider your answer correct, if .

Examples

input

output

input

output

Note

In the first case, there are only two balls. In the first two rounds, Andrew must have drawn the 2 and Jerry must have drawn the 1, and vice versa in the final round. Thus, Andrew's sum is 5 and Jerry's sum is 4, so Jerry never has a higher total.

In the second case, each game could've had three outcomes — 10 - 2, 10 - 1, or 2 - 1. Jerry has a higher total if and only if Andrew won 2 - 1 in both of the first two rounds, and Jerry drew the 10 in the last round. This has probability .

思路:暴力+概率；

每次都是独立的，我们单独看第一次，那么暴力枚举下第一次的所有的方案数，那么总的符合条件的方案就是sum^3;然后统计前两个组成的方案数，因为第三组要大于1，2两组的和，

那么我们只要枚举一二两组的和统计下前缀，然后枚举第三组，找小于第三组的就行。

复杂（N*N）

 

#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<stdlib.h>
#include<queue>
#include<string.h>
using namespace std;
int ans[3000];
int cnt[6000];
int num[6000];
long long sum[10005];
int main(void)
{
        int n;
        while(scanf("%d",&n)!=EOF)
        {       double am = 0;
                memset(cnt,0,sizeof(cnt));
                memset(num,0,sizeof(num));
                int i ,j;
                for(i = 1; i <= n; i++)
                        scanf("%d",&ans[i]);
                for(i = 1; i <= n; i++)
                {
                        for(j = i+1; j  <=n; j++)
                        {
                                int x = abs(ans[i]-ans[j]);
                                //printf("%d
",x);
                                num[x]++;
                        }
                }
                for(i = 1; i < 6000; i++)
                {
                        cnt[i]+=cnt[i-1]+num[i];
                }
                memset(sum,0,sizeof(sum));
                for(i = 1; i < 5000; i++)
                {
                        for(j = 1; j < i; j++)
                        {
                                if(num[j]&&num[i-j])
                                {
                                    sum[i]+=num[j]*num[i-j];
                                }
                        }
                }
                for(i = 1;i <= 5000;i++)
                    sum[i] += sum[i-1];
                for(i = 2;i <= 5000;i++)
                {
                    if(num[i])
                    {
                        am += sum[i-1]*num[i];
                    }
                }
                double maxx = cnt[5000];
                maxx = maxx*maxx*maxx;

                double an = 1.0*am/maxx;
                printf("%.10f
",an);
        }
        return 0;
}