解析：先找出最大值，再逐一判断最大值是否都是其他数的倍数，详见代码：

#include<bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
    int t;
    cin >> t;
    while(t--) {
        int n;
        cin >> n;
        int x = 0;
        for(int i = 1; i <= n; i++) {
            cin >> a[i];
            x = max(x, a[i]);
        }
        bool flag = 0;
        for(int i = 1; i <= n; i++) {
            if(x % a[i]) {
                flag = 1;
            }
        }
        if(flag == 1)  {
            cout << "No" << endl;
        } else {
            cout << "Yes" << endl;
        }
    }
}