hdu5645(基础)

最新推荐文章于 2019-03-19 22:05:25 发布

bokzmm

最新推荐文章于 2019-03-19 22:05:25 发布

阅读量400

点赞数

分类专栏： hduoj 基础

本文链接：https://blog.csdn.net/bokzmm/article/details/50935459

版权

hduoj 同时被 2 个专栏收录

98 篇文章 0 订阅

订阅专栏

基础

43 篇文章 0 订阅

订阅专栏

红包券大放送~~
招聘——巴卡斯（杭州），英雄互娱（杭州）

DZY Loves Balls

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 152 Accepted Submission(s): 103

Problem Description

DZY loves playing balls.

He has

n balls in a big box. On each ball there is an integer written.

One day he decides to pick two balls from the box. First he randomly picks a ball from the box, and names it

A . Next, without putting

A back into the box, he randomly picks another ball from the box, and names it

B .

If the number written on

A is strictly greater than the number on

B , he will feel happy.

Now you are given the numbers on each ball. Please calculate the probability that he feels happy.

Input

First line contains

t denoting the number of testcases.

t testcases follow. In each testcase, first line contains

n , second line contains

n space-separated positive integers

ai , denoting the numbers on the balls.

(

1≤t≤300,2≤n≤300,1≤ai≤300 )

Output

For each testcase, output a real number with 6 decimal places.

Sample Input

      
      
       
       2
3
1 2 3
3
100 100 100

Sample Output

      
      
       
       0.500000
0.000000
      
      
      
      
       
       ac代码：
      
      
      
      
       
       
       
       hdu5645 
//有n个球,每个球的编号都不同，现在从中依次拿出两个,问第一个的标号大于第二个的概率是多少？
//首先，将n个球排序，然后循环找出第一次的标号大于第二次的所有方案；除以所有方案数n(n-1)就是答案。 
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
	int t,n,i,j,cnt,a[320];
	double result;
	scanf("%d",&t);
	while(t--)
	{
      scanf("%d",&n);
	  for(i=0;i<n;i++)
	   scanf("%d",&a[i]);
	  sort(a,a+n);
	  cnt=0;
	  for(j=n-1;j>=1;j--)
	  {
	  	for(i=j-1;i>=0;i--)
	  	{
	  	  if(a[j]>a[i]) cnt++;	
		}
	  }	
	 result=((double)cnt)/(double)(n*(n-1));
	 printf("%lf\n",result);	
	}
	return 0;
}