包AC

#include<bits/stdc++.h>
using namespace std;
int n,m,a[100010],f=0;
int main(){
	cin >> n;
	for(int i=0; i<n; i++){
		f=0;
		cin >> m;
		for(int j=0; j<m; j++){
			cin >> a[j];
		}
		sort(a,a+m);
		int x=a[m-1];
		for(int j=0; j<m; j++){
			if(x%a[j]!=0) {
				cout << "No\n";
				f=1;
				break;
			}
		}
		if(f==0) cout << "Yes\n";
	} 
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main(){
	long long n,m,cnt;
	cin>>n;
	for(long long i=1;i<=n;i++){
		cin>>m;
		long long a[m]={0};
		long long c=0;
		for(long long j=0;j<m;j++){
			cin>>a[j];
			c=a[j]>c?a[j]:c;
		}
		cnt=0;
		for(long long j=0;j<m;j++){
			if(c%a[j]==0){
				cnt++;
			}	
		}
		if(cnt==m){
			cout<<"Yes"<<endl;
		}
		else cout<<"No"<<endl;
	}

	return 0;
}

#include<bits/stdc++.h>
using namespace std;
int main() {
   int t;
   cin >> t;
   while (t--) {
       int n;
       cin >> n;
       vector<int> a(n);
       int q_b = 0;
       for (int i = 0; i < n; ++i) {
           cin >> a[i];
           q_b = max(q_b, a[i]);
       }
       bool b_q = true;
       for (int i = 0; i < n; ++i) {
           if (q_b % a[i] != 0) {
               b_q = false;
               break;
           }
       }
       if (b_q) {
           cout << "Yes" << endl;
       } else {
           cout << "No" << endl;
       }
   }
   return 0;
}