文章标题 Friends
来源:互联网 发布:恶搞新闻联播软件 编辑:程序博客网 时间:2024/06/06 04:46
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
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
题意:两个人有k个相同的朋友,则这两个人也是朋友,问有几个新朋友
#include<cstdio>#include<cstring>#include<iostream>using namespace std;int main(){ int T; cin>>T; while(T--) { int n,m,k,sum=0; cin>>n>>m>>k; int a,b; int i,j,map[109][109]; memset(map,0,sizeof(map)); for(i=0;i<n;i++) map[i][i]=1; for(i=1;i<=m;i++) { cin>>a>>b; map[a][b]=map[b][a]=1; } while(1) { int flag=0; for(i=0;i<n;i++) { for(j=0;j<n;j++) { if(!map[i][j]) { int ans=0; for(int v=0;v<n;v++) { if(map[i][v]&&map[v][j]) ans++; } if(ans>=k) { sum++; map[i][j]=map[j][i]=1; flag=1; } } } } if(!flag) break; } printf("%d\n",sum); }}
- 文章标题 Friends
- 文章标题 coderforces 761B : Dasha and friends(KMP)
- 文章标题 HDU 3172 : Virtual Friends (并查集+map)
- 文章标题文章标题文章标题文章标题文章标题文章标题文章标题文章标题文章标题文章标题文章标题文章标题文章标题文章标题文章标题文章标题文章标题
- 文章标题
- 文章标题
- 文章标题
- 文章标题 文章标题 文章标题 文章标题
- 文章标题
- 文章标题
- 文章标题
- 文章标题
- 文章标题
- 文章标题
- 文章标题
- 文章标题
- 文章标题
- 文章标题
- Git问题Everything up-to-date解决
- 使用自定义用户登陆Vagrant box
- Linux下命令行安装weblogic
- 给键盘添加一个tooBar,完成按钮,以及对写一个分类的理解
- Hibernate和Spring data jpa的区别?
- 文章标题 Friends
- js时间戳转换字符串,过滤html字符串标签
- symfony consloe总结
- 安装spring IDE +第一个spring程序
- [kuangbin带你飞]专题一 简单搜索E
- Vue 精华一页纸
- UVA
- 第七届 蓝桥杯 省赛 第八题 四平方和
- 基于OpenSLL的RSA加密应用