Turtle Tenacity: Continual Mods | Codeforces 1933D Solution | Codeforces Round 929 (Div.3) | English

[@SLMN]

Thanks a lot!

[@Profnegi]

I did this in that way.. of gcd(same meaning)
void solve() {
int tt;
cin >> tt;
while (tt--) {
int n;
cin>>n;
vector arr(n);
cin>>arr;
bool flag = 0;
sort(arr.begin(),arr.end());
int min1 = arr[0];
int min2 = arr[1];
for(int i=1;i