ZOJ 3710 Friends(暴力)

暴力判断就行了

#include<iostream>
#include<cstdio>
#include<set>
#include<string>
#include<string.h>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<algorithm>
#include<sstream>
#include<utility>
#define mt(a) memset(a,0,sizeof (a))
#define fl(a,b,c) fill(a,b,c)
#define SWAP(a,b,t) (t=a,a=b,b=t)

#define inf 1000000000+7

using namespace std;
typedef long long ll;
int g[160][160];

int main()
{
	int T;
	cin >> T;
	while (T--)
	{
		int n, m, k;
		mt(g);
		scanf("%d %d %d", &n, &m, &k);
		for (int i = 0; i < m; i++)
		{
			int x, y;
			scanf("%d %d", &x, &y);
			g[x][y] = 1;
			g[y][x] = 1;
		}
		int ans = 0;
		while (1)
		{
			int flag = 0;
			for (int i = 0; i < n; i++)
			{
				for (int j = i+1; j < n; j++)
				{
					if (g[i][j])continue;
					int cot = 0;
					for (int l = 0; l < n; l++)
					{
						if (g[i][l] && g[l][j])cot++;
						
					}
					if (cot >= k)
					{
						flag = 1;
						ans++;
						g[i][j] = 1; g[j][i] = 1;
					}
				}
			}
			if (flag==0)break;
		}
		printf("%d\n", ans);
	}
	return 0;
}