2014ACM集训13级PK赛3-Friends
来源:互联网 发布:idc国际数据公司怎么样 编辑:程序博客网 时间:2024/05/17 04:10
Description
Alice lives in the country where people like to make friends. The friendship is bidirectional and if any two person have no less than kfriends 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 mlines 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
不科学的题目= =,这次比赛看似不可能的题目都暴力过了,真是渣数据
#include <stdio.h>#include <string.h>#include <stdlib.h>int p[101][101];int main(){ int N; scanf ("%d",&N); while (N--) { memset (p,0,sizeof(p)); int n,m,K; int i,k; scanf ("%d%d%d",&n,&m,&K); for (i = 0; i < m; i++) { int a,b; scanf ("%d%d",&a,&b); p[a][b] = 1; p[b][a] = 1; } int ans = 0; int tf = 1; while (tf) { tf = 0; for (i = 0; i < n; i++) { for (k = i + 1; k < n; k++) { if (p[i][k]) continue; int sum = 0; for (int j = 0; j < n; j++) { if (p[i][j] == 1 && p[k][j] == 1) sum++; } if (sum >= K) { tf = 1; ans++; p[i][k] = 1; p[k][i] = 1; } } } } printf ("%d\n",ans); } return 0;}
- 2014ACM集训13级PK赛3-Friends
- 2014ACM集训13级PK赛3-Taxi Fare
- 2014ACM集训13级PK赛3-Modular Inverse
- 2014ACM集训13级PK赛3-Java Beans
- 2014寒假ACM集训13级PK赛-翻转排序
- 2014寒假ACM集训13级PK赛-购买矿石
- 2014ACM集训13级PK赛2-Somali Pirates
- 2014ACM集训13级PK赛2-Wu Xing
- 2014ACM集训13级PK赛2-Ordinal Numbers
- 2014ACM集训13级PK赛2-Conic Section
- 2014ACM集训13级PK赛2-Kagome Kagome
- 2014ACM集训13级PK赛2-Javabeans
- 2014ACM集训13级PK赛2-Median
- 2014ACM集训13级PK赛4-K-Nice
- 2014ACM集训13级PK赛4-Light Bulb
- 2014ACM集训13级PK赛5-Easy Task
- 2014ACM集训13级PK赛3-Draw Something Cheat
- 2014ACM集训13级PK赛3-Yet Another Story of Rock-paper-scissors
- awk命令详解
- VPS还是虚拟主机,究竟应该如何选择
- float和double类型数据做比较问题
- IBOutlet,IBAction简单的解释
- EJB 配置jboss 数据源 及 对数据库映射的实体Bean
- 2014ACM集训13级PK赛3-Friends
- Ant build.xml中的各种变量
- Cstyle的札记,R&D必读手册,第1篇 SDRAM
- 最长不下降子序列——序列型动态规划
- vmare tool的安装方式
- ant property 总结
- 【opencv】两条平行线之间的距离
- s2sh整合遇到的问题Error creating bean with name
- 二项分布和泊松定理