CF C 求叉/求证

#include<bits/stdc++.h>
using namespace std;
const int N = 110;
using ll = long long;
ll a[N];
int vis[N][N];
bool solve(){
    int n;cin>>n;
    memset(vis,0,sizeof(vis));
    for (int i=1;i<=n;++i) {
        cin>>a[i];
        for (int j=1;j<=n;++j) vis[j][a[i]%j]++;
    }
    for (int i=1;i<=n;++i){
        for (int j=i+1;j<=n;++j){
            if (a[i]==a[j]) return 0;
        }
    }
    for (int i=2;i<=n;++i){
        int cnt=0;
        for (int j=0;j<i;++j) {
            cnt+=vis[i][j]>=2;
        }
        if (cnt==i) return 0;
    }
    return 1;
}
int main(){
    int t;cin>>t;
    while(t--) {
        bool ed=solve();
        if (ed) puts("Yes");
        else puts("No");
    }
    return 0;
}