ZOJ Problem Set - 3708 Density of Power Network

简介:
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
#include <stdio.h>
#include <string.h>
int main( int argc, char *argv[])
{
     int T,i,j,lineSum;
     int N,M;    
     int x[505],y[505];
     int lineL [505][505] ;
     
     scanf ( "%d" ,&T);
     for (i = 0 ; i < T ;i++){                   
         lineSum = 0;           
         scanf ( "%d %d" ,&N,&M);
         
         
         memset (lineL,0, sizeof (lineL));
         memset (lineL,0, sizeof (x));
         memset (lineL,0, sizeof (y));
         
         for (j = 0 ; j < M ;j++){
             scanf ( "%d" ,&x[j]);     
         }
         for (j = 0 ; j < M ;j++){
             scanf ( "%d" ,&y[j]);
         }
         for (j = 0 ; j < M ;j++){
             if (lineL[x[j]][y[j]] == 0 && lineL[y[j]][x[j]] == 0){
                 
                 lineSum ++;
                 lineL[x[j]][y[j]]=lineL[y[j]][x[j]]=1; 
                 
             }
         }      
         printf ( "%.3f\n" ,lineSum/(N*1.0));
     }
     
     return 0;
}

  

相关文章
ZOJ - Problem Set - 3960 What Kind of Friends Are You?
ZOJ - Problem Set - 3960 What Kind of Friends Are You?
88 0
ZOJ - Problem Set - 3960 What Kind of Friends Are You?
ZOJ - Problem Set - 3985 String of CCPC
ZOJ - Problem Set - 3985 String of CCPC
102 0
ZOJ Problem Set - 3758 素数
ZOJ Problem Set - 3758 素数
102 0
|
机器学习/深度学习 人工智能 BI
ZOJ Problem Set - 3758 素数
Singles’ Day Time Limit: 2 Seconds Memory Limit: 65536 KB Singles’ Day(or One’s Day), an unofficial holiday in China, is a pop cu...
928 0
|
存储 算法 索引
ZOJ 3505. Yet Another Set of Numbers 解题报告
    ZOJ 3505:Yet Another Set of Numbers     地址:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3505       题意:有一个数字集合,集合中的数遵循以下规则:       ( 1 ).
928 0