Friends

Friends

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

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

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
 
 
 
 

  
  这道题目纯暴力能过
 
 
 
 

  
  先说说暴力的思路吧
 
 
 
 

  
  对于图中的两个点i,j ，如果存在点l可以使得i,j联通，则将计数器加一，如果计数器的值大于等于k，则将i,j用边连接起来，只要有新边增加就重复上述操作，最后求新增边的条数
 
 
 
 

  
  
#include<iostream>
using namespace std;
int main()
{
	int t;
	cin >> t;
	while(t--)
	{
		int n,m,k,flag=1,edge=0;
		int rel[105][105]={0}; 
		cin >> n >> m >> k;
		for(int i=0;i<m;i++)
		{
			int u,v;
			cin >> u >> v;
			rel[u][v]=1;
			rel[v][u]=1;
		}
		while(flag)
		{
			flag=0;
			for(int i=0;i<n;i++)
			{
				for(int j=i+1;j<n;j++)
				{
					int sum_friend=0;
					if(rel[i][j])
						continue;
					for(int l=0;l<n;l++)
					{
						if(rel[i][l]&&rel[l][j])
							sum_friend++;
					}					
					if(sum_friend>=k)
					{
						rel[i][j]=1;
						rel[j][i]=1;
						flag=1;
						edge++;
						break;
					}
				}
			}
		}
		cout << edge << endl;
	}
	return 0;
}