test_case = int(input())
for i in range(test_case):
arr_size = int(input())
arr = list(map(int,input().split()))
n = len(arr)
boolean = False
for i in range(n):
if arr[i] % arr[0] == 0:
boolean = True
else:
boolean = False
break
if boolean == True:
print("YES")
else:
print("NO")#include <bits/stdc++.h>
using namespace std;
// #define f(a,n) for(int i=a;i<n;i++)
int main()
{
int t,n;
cin>>t;
while(t--){
cin>>n;
int arr[n];
for(int i=0;i<n;i++)
cin>>arr[i];
int count=0;
for(int i=1;i<n;i++){
if(arr[i]%arr[0]==0)
count++;
}
if(count==n-1)
cout<<"yes"<<endl;
else
cout<<"no"<<endl;
}
return 0;
}36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |