题意:
让你找大小为s的完全子图有几个
题解:
一开始直接想到极大团+组合数,去重去不了
后来写了发爆搜直接过了
就是和最大团写法一样维护一个vset,vset中每个点都和当前已选择点有边连接,然后扩展就行了
#include<set>
#include<map>
#include<cmath>
#include<stack>
#include<queue>
#include<bitset>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
#define PB push_back
#define MP make_pair
#define ll long long
#define MS(a,b) memset(a,b,sizeof(a))
#define LL (rt<<1)
#define RR (rt<<1|1)
#define lson l,mid,LL
#define rson mid+1,r,RR
#define pii pair<int,int>
#define pll pair<ll,ll>
#define lb(x) (x&(-x))
void In(){freopen("in.in","r",stdin);}
void Out(){freopen("out.out","w",stdout);}
const int N=1e2+10;
const int M=3e5+10;
const int Mbit=1e6+10;
const int inf=0x3f3f3f3f;
const ll mod=1e9+7;
int g[N][N],n,s;
ll ans;
void clique(int l,int u[],int cnt)
{
int next[N];
int len,i,j;
int num=0;
if(cnt==s){ans++;return;}
if(l){
if(l+cnt<s)return;
for(i=1;i<=l;i++){
len=0;
for(j=i+1;j<=l;j++){
if(g[u[i]][u[j]])
next[++len]=u[j];
}
clique(len,next,cnt+1);
}
}
}
void maxclique()
{
int next[N];
int len,i,j;
for(i=1;i<=n;i++){
len=0;
for(j=i+1;j<=n;j++)
if(g[i][j])
next[++len]=j;
clique(len,next,1);
}
}
int main()
{
int T,m;
scanf("%d",&T);
while(T--){
scanf("%d%d%d",&n,&m,&s);
MS(g,0);
while(m--){
int u,v;scanf("%d%d",&u,&v);
g[u][v]=g[v][u]=1;
}
ans=0;
maxclique();
printf("%d\n",ans);
}
return 0;
}