CSY版最大团，速度快一倍

#include <bits/stdc++.h>

using namespace std;

#define REP(i, n)                 for(int i(0); i <  (n); ++i)
#define rep(i, a, b)              for(int i(a); i <= (b); ++i)
#define dec(i, a, b)              for(int i(a); i >= (b); --i)
#define for_edge(i, x)            for(int i = H[x]; i; i = X[i])

#define LL      long long
#define ULL     unsigned long long
#define MP      make_pair
#define PB      push_back
#define FI      first
#define SE      second
#define INF     1 << 30

const int N     =          +       ;
const int M     =           +       ;
const int Q     =            +       ;
const int A     =              +       ;

typedef long long ll;

int T;
int n;
ll a[Q];
ll c[Q][Q];
ll mx[Q],s[Q],ans;
ll f[Q][Q];
int i,j,k;

int dfs(int cur,int tot)
{
    if(!cur){
        if(tot>ans) return ans=tot,;
        return ;
    }
    for(int i=,j,u,nxt;i<cur;i++)
    {
        if(cur-i+tot<=ans) return ;
        u=f[tot][i],nxt=;
        if(mx[u]+tot<=ans) return ;
        for(int j=i+;j<cur;j++)
        if(c[u][f[tot][j]]) f[tot+][nxt++]=f[tot][j];
        if(dfs(nxt,tot+)) return ;
    }
    return ;
}
int main(){

    for (scanf("%d", &T); T--; ){
        scanf("%d", &n);
        memset(c, , sizeof c);
        rep(i, , n) scanf("%lld", a + i);
        rep(i, , n - ) rep(j, i + , n){
            if (a[i] % a[j] !=  && a[j] % a[i] != ){
                c[i-][j-] = c[j-][i-] = ;
            }
        }

    /*    rep(i, 1, n){
            rep(j, 1, n) printf("%d ", c[i][j]);
            putchar(10);
        }*/
        memset(mx,,sizeof(mx));
        memset(s,,sizeof(s));
        ans=;
        for(i=n-;~i;dfs(k,),mx[i--]=ans)
        for(k=,j=i+;j<n;j++)
        if(c[i][j]) f[][k++]=j;
        printf("%lld\n",ans);
    }
    return ;

}