题解 | 来点gcd

#include <bits/stdc++.h>
#define il inline

using namespace std;
using ll = long long;
using ull = unsigned long long;
using int128=__int128_t;

const ll N = 1e5 + 5, mod =1e9+7, inf = 2e18;
const double esp=1e-9;
double PI=3.1415926;

il void solve(){  
    int n,m;
    cin>>n>>m;
    vector<int>cnt(n+5);
    for(int i=1;i<=n;i++){
        int x;
        cin>>x;
        cnt[x]++;
    }
    vector<int>g(n+5);
    for(int i=1;i<=n;i++){
        int G=0;
        for(int j=i;j<=n;j+=i){
            if(cnt[j]){
                G=gcd(G,j);
                if(G==i)break;
            }
        }
        g[i]=G;
    }
    while(m--){
        int x;
        cin>>x;
        if(g[x]==x){
            cout<<"YES\n";
        }else{
            cout<<"NO\n";
        }
    }
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    
    int t = 1;

    cin >> t;

    while (t--) {

        solve();

    }

    return 0;
}