# Codeforces C. Mere Array (思维 / gcd) (Round #665 Div.2)

• 如果a数组的min为1，那么绝对可以同过这个1让所有元素归位，因为1是任何元素的因子。
• 多推几个例子就不难发现，其实所有的交换基本上都是通过min实现的，那么对于不是min倍数的元素将无法改变其位置，就无法实现非递减的目的。

#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int  inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll   mod = 1e9 + 7;
const int  N = 2e5 + 5;

int t, n, a[N], b[N];

signed main(){
IOS;
cin >> t;
while(t --){
cin >> n;
int minn = inf;
for(int i = 0; i < n; i ++){
cin >> a[i]; b[i] = a[i];
minn = min(minn, a[i]);
}
if(minn == 1) cout << "YES" << endl;
else{
sort(b, b + n);
bool ok = 1;
for(int i = 0; i < n; i ++)
if(a[i] != b[i] && a[i]%minn) {ok = 0; break;}
cout << (ok ? "YES" : "NO") << endl;
}
}
return 0;
}



05-20 4865
10-02 721