# D. Jerry's Protest

time limit per test：2 seconds

memory limit per test：256 megabytes

input：standard input

output：standard output

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.

.

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

.

``` 1 #include <bits/stdc++.h>
2 using namespace std;
3 typedef long long ll;
4 const int N=5050;
5 int n;
6 double ans;
7 ll cnt[N<<2],a[N<<2],b[N<<2];
9 {
10     int x=0,f=1;
11     char ch=getchar();
12     while(ch<'0'||ch>'9')
13     {
14         if(ch=='-')
15             f=-1;
16         ch=getchar();
17     }
18     while(ch>='0'&&ch<='9')
19     {
20         x=x*10+ch-'0';
21         ch=getchar();
22     }
23     return x*f;
24 }
25 int main()
26 {
28     for(int i=1;i<=n;i++)
30     sort(a+1,a+1+n);
31     for(int i=1;i<=n;i++)
32     {
33         for(int j=n-1;j>=1;j--)
34         {
35             cnt[a[i]-a[j]]++;
36         }
37     }
38     ll sum=(n-1)*n/2;
39     for(int i=1;i<=5000;i++)
40     {
41         for(int j=1;j<=5000;j++)
42         {
43             b[i+j]+=1ll*cnt[i]*cnt[j];
44         }
45     }
46     for(int i=1;i<=5000;i++)
47     {
48         for(int j=i-1;j>=1;j--)
49         {
50             ans+=1.0*cnt[i]*b[j]/sum/sum/sum;
51         }
52     }
53     printf("%.10lf\n",ans);
54     return 0;
55 }```

0 条评论

• ### Code forces 719A Vitya in the Countryside

A. Vitya in the Countryside time limit per test:1 second memory limit per test:2...

• ### Codeforces Round #301 (Div. 2)(A,【模拟】B,【贪心构造】C,【DFS】)

A. Combination Lock time limit per test：2 seconds memory limit per test：256 mega...

• ### Codeforces Round #300(A.【字符串，多方法】，B.【思维题】，C.【贪心,数学】)

A. Cutting Banner time limit per test：2 seconds memory limit per test：256 megaby...

• ### 2019 ICPC 南京网络赛 H-Holy Grail

As the current heir of a wizarding family with a long history,unfortunately, you...

• ### CodeForces - 262C 贪心

Maxim always goes to the supermarket on Sundays. Today the supermarket has a spe...

• ### CodeForces 665A Buses Between Cities

A. Buses Between Cities time limit per test 1 second memory limit per test ...

• ### HOJ-2056 Bookshelf（线性动态规划）

L is a rather sluttish guy. He almost never clean up his surroundings or regulat...

• ### Evaluating the linear regression model评估线性回归模型

In this recipe, we'll look at how well our regression fits the underlying data. ...

• ### Poor man's grid search穷举网格搜索

In this recipe, we're going to introduce grid search with basic Python, though w...

• ### 操作系统 Interrupt 执行的具体步骤

本文内容主要摘抄于 Intel® 64 and IA-32 Architectures Software Developer's Manual，其详细介绍了 i...