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

2
1 2

output

0.0000000000

input

3
1 2 10

output

0.0740740741

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 .

题意：两个人在做游戏，一个袋子里有n个球，球上的数字大小都不相同，共进行三回合，每一回合两个人同时各自从袋子里拿出一个球，求前两个回合A拿出的球的数字大于B，但是三个回合加起来的数字的和B大于A的概率。

思路：我们可以先用cnt[i]记录一个局面中胜者和败者差值为i的取法数，再用cnt2[i]表示前两个局面胜者和败者差值的总和为i的方案数，然后统计cnt2的前缀和，那么符合题意的方案总数即为for(i=1;i<=5000;i++){tot+=cnt2[i]*cnt[i-1]};

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<string>
#include<algorithm>
using namespace std;
typedef long long ll;
#define inf 99999999
#define pi acos(-1.0)
ll cnt1[5005],cnt2[10050];
int a[2005];
int main()
{
    int n,m,i,j;
    while(scanf("%d",&n)!=EOF)
    {
        for(i=1;i<=n;i++){
            scanf("%d",&a[i]);
        }
        sort(a+1,a+1+n);
        for(i=1;i<=n;i++){
            for(j=1;j<i;j++){
                cnt1[a[i]-a[j] ]++;
            }
        }
        for(i=1;i<=5000;i++){
            for(j=1;j<=5000;j++){
                cnt2[i+j]+=cnt1[i]*cnt1[j];
            }
        }
        for(i=1;i<=10000;i++){
            cnt2[i]=cnt2[i]+cnt2[i-1];
        }
        ll tot=0;
        for(i=1;i<=5000;i++){
            tot+=cnt2[i-1]*cnt1[i];
        }
        double num=n*(n-1)/2;
        printf("%.10f\n",(double)tot/num/num/num );
    }
    return 0;
}