ZOJ 3710Friends

最新推荐文章于 2019-05-02 22:33:20 发布

Jianbagengmu

最新推荐文章于 2019-05-02 22:33:20 发布

阅读量388

点赞数

分类专栏：水题

本文链接：https://blog.csdn.net/jianbagengmu/article/details/70217332

版权

水题专栏收录该内容

111 篇文章 0 订阅

订阅专栏

Friends

Time Limit: 2000ms

Memory Limit: 65536KB

This problem will be judged on ZJU. Original ID: 3710
64-bit integer IO format: %lld Java class name: Main

Submit Status Statistics

Type:

None

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 u_i, v_i (0 ≤ u_i, v_i < n, u_i ≠ v_i) indicating there is friendship between person u_i and v_i.

Note: The edges in test data are generated randomly.

Output

For each case, print one line containing the answer.

Sample Input

Sample Output

2
0
4

现在很烦，对写题突然失去了兴趣，不是不想写，主要英文差，题目能让我看好久，

而且现在的我还拒绝翻译，怎么办我很痛苦啊；

快市赛了，队里没一个过4级的，我的英语在对里算是好的，到时候因为看不懂题写水题慢，翻车

怎么给自己和老郭翻译，最重要我们2队刚不过女队，真心丢人；

题意

有n个人有要是俩个人要想成为朋友，要至少有k个共同认识的人；

简单的map遍历，直接看代码；

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<algorithm>
#include<stack>
#include<queue>
using namespace std;
int map[200][200];
int main()
{
	//std::ios::sync_with_stdio(false);
	int t;
	while (cin>>t)
	{
		while (t--)
		{
			memset(map, 0, sizeof(map));
			int n, m, k, i, j;
			scanf("%d%d%d", &n, &m, &k);
			int x, y;
			while (m--)
			{
				scanf("%d%d", &x, &y);
				map[x][y] = map[y][x] = 1;
			}
			int count1 = 0, count2 = 0;
			for (i = 0; i < n; i++)
			{
				for (j = 0; j < n; j++)
				{
					count1 = 0;
					if (i != j&&map[i][j] == 0)
					{
						for (int p = 0; p < n; p++)
						{
							if (map[i][p] == map[j][p] && map[i][p] == 1)
								count1++;
						}
						if (count1 >= k)
						{
							count2++;
							map[i][j] = 1;
							map[j][i] = 1;
							i = 0;
							break;
						}
					}
				}
			}
			cout << count2 << endl;
		}
	}
	return 0;
}

Jianbagengmu

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
ZOJ 3710Friends

FriendsTime Limit: 2000msMemory Limit: 65536KBThis problem will be judged on ZJU. Original ID: 371064-bit integer IO format: %lld Java class name: MainPrev Submit Status S
复制链接

扫一扫

专栏目录