ZOJ 3710 Friends
来源:互联网 发布:企业邮箱需要域名吗 编辑:程序博客网 时间:2024/05/22 06:15
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 < n, ui ≠ 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
34 4 20 10 21 32 35 5 20 11 22 33 44 05 6 20 11 22 33 44 02 0
Sample Output
204
暴力来就好了
<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\n",ans); } } return 0;}
- ZOJ-3710(Friends)
- zoj 3710 Friends
- zoj 3710 Friends
- ZOJ 3710 Friends 暴力
- zoj 3710 Friends
- Friends zoj 3710
- ZOJ 3710 Friends
- zoj 3710 Friends
- ZOJ 3710 Friends
- ZOJ 3710 Friends
- ZOJ 3710Friends(暴力)
- ZOJ 3710 Friends
- ZOJ 3710 Friends
- ZOJ-3710-Friends
- ZOJ 3710 Friends
- Friends ZOJ 3710
- ZOJ 3710Friends
- ZOJ 3710 Friends (map + set)
- django进阶 - 用户信息扩展
- django进阶2 自定义认证方式
- django进阶3 权限设计和使用
- django进阶4 自定义模板库
- django进阶5 自定义标签
- ZOJ 3710 Friends
- iOS编程--AVCapture编程理解--自定义相机
- C语言结构体中定义函数指针
- 编程技巧 - NSString - 1
- Gson使用简记
- git分支操作整理
- concurrenthashmap 采用自动调整大小的数组锁,是不是效率更高一点呢?
- UE4启动器是否有办法添加本地版本
- 编译配置nginx-rtmp-moule