带技巧的暴力-ZOJ 3710 [Friends

#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <iostream>
#include <queue>
using namespace std;

int map[105][105];

int main()
{
	
	int i,j,t,n,m,k,p,cun,q,countt,a,b,flag;

	scanf("%d",&t);
	for (q=1;q<=t;q++)
	{
		memset(map,0,sizeof(map));
countt=0;
		scanf("%d%d%d",&n,&m,&k);
		for (i=1;i<=m;i++)
		{
			scanf("%d%d",&a,&b);
			map[a+1][b+1]=1;
			map[b+1][a+1]=1;
		}
int change=1;
		while(change)     //循环到不改有新朋友生成就结束，，如果做n次超时
		{
		change=0;
		for (i=1;i<=n;i++)
		{
		
						//新朋友
			for (j=1;j<=n;j++)
			{
					flag=0;
					cun=0;
				if (j==i) continue;    //自己
				if (map[i][j]==1) continue;  //已经是朋友，跳过
				for (p=1;p<=n;p++)              
				{
					if (map[i][p]&&map[j][p])       
						cun++;
					if (cun>=k) {flag=1;map[i][j]=1;map[j][i]=1;break;}
				}
				if (flag==1)   //i可以和j交朋友
				{
					countt++;    
				 change=1;
				}
			}
		}
		}

		printf("%d\n",countt);
		
	}
	
	
	return 0;
	
}