全RE求调,必关

#include <iostream>
using namespace std;
const int MAXN = 1e5;
int t , n , a[MAXN];
bool cnt = true;
int main() {
	scanf("%d" , &t);
	for (int i = 1 ; i <= t ; i++) {
		scanf("%d" , &n);
		for (int j = 1 ; j <= n ; i++) scanf("%d" , &a[i]);
		for (int j = 1 ; j <= n ; j++) {
			for (int k = 1 ; k <= n ; k++) {
				if (a[j] % a[k] != 0) {
					cnt = false;
					break;
				}
			}
			if (cnt == true) {
				printf("Yes\n");
				cnt = true;
				break;
			}
			if (cnt == false && j == n) {
				printf("No\n");
				cnt = true;
			}
		}
	}
	return 0;
}