ZOJ-3710

无意间发现一水题，随手刷了，发现又手贱地用Python去写了下。。果断TLE了，无奈还是用C吧

#include<stdio.h>
#include<string.h>

static int map[100][100];
static int common(int i, int j)
{
	int k, total = 0;
	for (k = 0; k < 100; k++)
		if (map[i][k] && map[j][k])
			total++;
	return total;
}

int main()
{
	int t, n, m, k, i, j;
	scanf("%d", &t);
	while (t--)
	{
		memset(map, 0, sizeof(map));
		scanf("%d %d %d", &n, &m, &k);
		int a, b;
		for (i = 0; i < m; i++)
		{
			scanf("%d %d", &a, &b);
			map[a][b] = map[b][a] = 1;
		}
		int has_new = 1, total = 0;
		while (has_new)
		{
			has_new = 0;
			for (i = 0; i < n && !has_new; i++)
				for (j = 0; j < n && !has_new; j++)
					if (i != j && !map[i][j] && common(i, j) >= k)
					{
						map[i][j] = map[j][i] = 1;
						has_new = 1;
						total++;
					}
		}
		printf("%d\n", total);
	}
	return 0;
}