1789A - Serval and Mocha's Array.cpp

#include<bits/stdc++.h>
using namespace std;

// Code Written By: Vikash Patel

bool beautiful(int a[] , int n)
{
    int g=INT_MAX;
    for(int i=0;i<n;i++)
    {
        for(int j=i+1;j<n;j++)
        {
            g=min(__gcd(a[i], a[j]), g);
        }
    }
    if(g>2)
    return false;
    else
    return true;
}

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        int a[n];
        for(int i=0;i<n;i++)
        {
            cin>>a[i];
        }
        if(beautiful(a,n))
        cout<<"YES"<<endl;
        else
        cout<<"NO"<<endl;
    }
}