CF 1401C

You are given an array a1,a2,…,an where all ai are integers and greater than 0.

In one operation, you can choose two different indices i and j (1≤i,j≤n). If gcd(ai,aj) is equal to the minimum element of the whole array a, you can swap ai and aj. gcd(x,y) denotes the greatest common divisor (GCD) of integers x and y.

Now you’d like to make a non-decreasing using the operation any number of times (possibly zero). Determine if you can do this.

An array a is non-decreasing if and only if a1≤a2≤…≤an.

Input
The first line contains one integer t (1≤t≤104) — the number of test cases.

The first line of each test case contains one integer n (1≤n≤105) — the length of array a.

The second line of each test case contains n positive integers a1,a2,…an (1≤ai≤109) — the array itself.

It is guaranteed that the sum of n over all test cases doesn’t exceed 105.

Output
For each test case, output “YES” if it is possible to make the array a non-decreasing using the described operation, or “NO” if it is impossible to do so.

Example
input
4
1
8
6
4 3 6 6 2 9
4
4 5 6 7
5
7 5 2 2 4
output
YES
YES
YES
NO
Note
In the first and third sample, the array is already non-decreasing.

In the second sample, we can swap a1 and a3 first, and swap a1 and a5 second to make the array non-decreasing.

In the forth sample, we cannot the array non-decreasing using the operation.

---

题意

给你个数组 $a$，如果 $gcd(a_i,a_j)$ 等于整个数组 $a$ 中的最小元素 $m$，你可以交换 $a_i$ 和 $a_j$，问能否交换成 不降序列。

思路

设 $gcd(a_i,a_j)$ 等于整个数组 $a$ 中的最小元素为 $m$，那意思就是只有 $m$ 的倍数 包括 $m$ 才可以交换，其他元素不可以动。因此只要判断不能动的元素是否满足题意即可。

#include<bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
typedef long long ll;

int main()
{
	int t; cin >> t;
	while (t--)
	{
		int n; cin >> n;
		vector<int> a(n), b(n);
		int minn = 1e9;
		for (int i = 0; i < n; i++)
		{
			cin >> a[i]; b[i] = a[i];
			minn = min(minn, a[i]);
		}

		sort(b.begin(), b.end());
		bool flag = true;
		for (int i = 0; i < n; i++)
		{
			if (a[i] != b[i] && a[i] % minn != 0) flag = false;
		}

		if (flag) puts("yes");
		else puts("No");
	}
	
	return 0;
}