acm-杭电-5645

直接遍历,找出所有ai<aj的对数,再除以n*(n-1)



 
Online Judge	Online Exercise	Online Teaching	Online Contests	Exercise Author
F.A.Q
Hand In Hand
Online Acmers	
Forum | Discuss
Statistical Charts
Problem Archive
Realtime Judge Status
Authors Ranklist

 Search
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
Virtual Contests 
    DIY | Web-DIY beta
Recent Contests
Author adolph_jun
Mail Mail 0(0)
Control Panel Control Panel 
Sign Out Sign Out
New~~招聘——壹晨仟阳(杭州),巴卡斯(杭州),英雄互娱(杭州) 
2016 阿里云 红包券 大放送~~
View Code

Problem : 5645 ( DZY Loves Balls )     Judge Status : Accepted
RunId : 16633841    Language : C    Author : adolph_jun
Code Render Status : Rendered By HDOJ C Code Render Version 0.01 Beta
#include <stdio.h>
int main()
{
       int t;
       int i,j;
       float n,m;
       int num[500];
       scanf ("%d",&t);
       while (t--)
       {
              m=0;
              memset(num,0,sizeof(num));
              scanf ("%f",&n);
              for (i=0; i<n; i++)
              {
                     scanf ("%d",&num[i]);
              }
              for (i=0; i<n; i++)
              {
                     for (j=0; j<n; j++)
                     {
                            if(num[i]>num[j]) m++;
                     }
              }
              //printf("%f  %f",n,m);
              printf("%f\n",m/(n*(n-1.0)));
       }
       return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值