ZOJ 3710 Friends
来源:互联网 发布:java api 中文 在线 编辑:程序博客网 时间:2024/05/22 06:07
Alice lives in the country where people like to make friends. The friendship is bidirectional and if any two person have no less thank friends in common, they will become friends in several days. Currently, there are totallyn 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. ThenT 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 integersui, vi (0 ≤ ui, vi <n, ui ≠ vi) indicating there is friendship between personui 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
/**题意: n个人,有m个朋友关系(双向),如果两个人有num个以上的(含num)个公共朋友,那么他们也是朋友,问可以新加几个朋友关系思路: 暴力,枚举i j之间有多少个公共朋友**/
include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;int main(){ int T,n,m,num,a[200][200],ta,tb; scanf("%d",&T); while(T--) { memset(a,0,sizeof(a)); scanf("%d%d%d",&n,&m,&num); for(int i=0;i<m;i++) { scanf("%d%d",&ta,&tb); a[ta][tb]=a[tb][ta]=1; } int ans=0,flag=1; while(flag) { flag=0; for(int i=0;i<n;i++) { for(int j=i+1;j<n;j++) { int cnt=0; if(!a[i][j]) { for(int l=0;l<n;l++) { cnt+=a[i][l]&&a[l][j]; } if(cnt>=num) { flag=1; ans++; a[i][j]=a[j][i]=1; } } } } } 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)
- ACM —— 1001 Exponentiation
- 排序
- QT编译运行时出现xxx.exe does not exist.
- SizesClasses,autolayout 的frame设置问题
- OC基础:Foundation框架之NSString和NSMutableString
- ZOJ 3710 Friends
- java GUI--day22
- java 大数阶乘代码
- 聊聊并发——深入分析ConcurrentHashMap
- 使用序列化实现对象的拷贝
- 三分钟理解“命令模式”——设计模式轻松掌握
- Android 反编译详细介绍
- sort 命令--linux
- ssl change ciper spec