ZOJ 3710 Friends 暴力

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 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.

建二维数组储存关系，然后搜索没有关系的有多少共同朋友，如果大于等于k则生成新关系，需要重头在搜索，直至没有新关系生成

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
	int t;
	int map[105][105];
	cin>>t;
	while(t--)
	{
		memset(map,0,sizeof(map));
		int count=0;
		int n,m,k;
		int p,q;
		cin>>n>>m>>k;
		for(int i=0;i<m;i++)
		{
			cin>>p>>q;
			map[p][q]=1;
			map[q][p]=1;
		}
		int flag=1;
		while(flag)//有无新关系 ，直到无新关系生成 
		{
			flag=0;
			for(int i=0;i<n-1;i++)
			{
				for(int j=i+1;j<n;j++)
				{
					if(map[i][j]==0)
					{
						int common=0;
						for(int l=0;l<n;l++)
						{
							if(map[i][l]&&map[j][l])
							{
								common++;
							}
						}
						if(common>=k)
						{
							count++;
							map[i][j]=1;
							map[j][i]=1;
							flag=1;//有新朋友关系生成，重新扫 
						}
					}
				}
			}
		}
		cout<<count<<endl;
	}
	return 0;
}