zoukankan      html  css  js  c++  java
  • ZOJ 3710 Friends

    Alice lives in the country where people like to make friends. The friendship is bidirectional and if any two person have no less than k friends in common, they will become friends in several days. Currently, there are totally n people in the country, and m friendship among them. Assume that any new friendship is made only when they have sufficient friends in common mentioned above, you are to tell how many new friendship are made after a sufficiently long time.

    Input

    There are multiple test cases.

    The first lien of the input contains an integer T (about 100) indicating the number of test cases. Then T cases follow. For each case, the first line contains three integers n, m, k (1 ≤ n ≤ 100, 0 ≤ m ≤ n×(n-1)/2, 0 ≤ k ≤ n, there will be no duplicated friendship) followed by m lines showing the current friendship. The ith friendship contains two integers ui, vi (0 ≤ ui, vi < nui ≠ vi) indicating there is friendship between person ui and vi.

    Note: The edges in test data are generated randomly.

    Output

    For each case, print one line containing the answer.

    Sample Input

    3
    4 4 2
    0 1
    0 2
    1 3
    2 3
    5 5 2
    0 1
    1 2
    2 3
    3 4
    4 0
    5 6 2
    0 1
    1 2
    2 3
    3 4
    4 0
    2 0

    Sample Output

    2
    0
    

    4

    暴力来就好了

    <pre name="code" class="html">#include <iostream>
    #include <string.h>
    #include <stdlib.h>
    #include <stdio.h>
    #include <algorithm>
    #include <math.h>
    
    using namespace std;
    int v[105][105];
    int n,m,k,t;
    int ans;
    int main()
    {
        int x,y;
         while(scanf("%d",&t)!=EOF)
         {
             while(t--)
             {
                 scanf("%d%d%d",&n,&m,&k);
                 memset(v,0,sizeof(v));
                 for(int i=1;i<=m;i++)
                 {
                     scanf("%d%d",&x,&y);
                     v[x][y]=v[y][x]=1;
                 }
                 ans=0;
                 while(1)
                 {
                     bool flag=false;
                     for(int i=0;i<n;i++)
                     {
                         for(int j=i+1;j<n;j++)
                         {
                             if(v[i][j]) continue;
                             int num=0;
                             for(int k=0;k<n;k++)
                             {
                                 if(v[i][k]&&v[j][k])
                                    num++;
                             }
                             if(num>=k)
                             {
                                 flag=true;
                                 v[i][j]=v[j][i]=1;
                                 ans++;
                             }
                         }
                     }
                     if(!flag)
                        break;
                 }
                 printf("%d
    ",ans);
             }
         }
         return 0;
    }
    



    
       
    
    
  • 相关阅读:
    Android Studio移动鼠标显示悬浮提示的设置方法
    解决adb push时出现的"Read-only file system"问题
    VIM常见用法总结
    忘记oracle的sys用户密码怎么修改以及Oracle 11g 默认用户名和密码
    Oracle中session和processes的设置
    ssh相关原理学习与常见错误总结
    如何利用Oracle VM Templates 在几分钟内部署Oracle Real Application Clusters (RAC)
    Oracle导入导出常用命令
    Tomcat 到底依赖JRE还是JDK
    截取url参数值
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228732.html
Copyright © 2011-2022 走看看