A.cpp

 #include <bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    ///**************************** M a c r o ****************************///
    #define fi(i,n) for(int x = 0 ; x<n;x++) //to write 2d arrays faster ,generally arrays use
    #define ll long long
    #define Speedo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #define f(i,m,n) for(int i=m; i<n; i++)
    #define all(x) x.begin(),x.end()
    #define pb push_back
    #define print(arr,size) for(int i = 0; i<size;i++){cout<<arr[i]<<" ";}cout<<endl;
    #define news(f) int f; cin>>f;
    #define endl          '\n'
    #define return0 return 0
    #define Endl endl
    #define ull unsigned long long
    #define ssort(arr,n) sort(arr,arr+n)
    #define elif else if
    #define lo(f) if (f>='a' && f<='z')
    #define up(f) if (f>='A' && f<='Z')
    #define pff(a) a.size()
    #define gcd(a,b) __gcd(a,b)
    #define lcm(a,b) (a*(b/gcd(a,b)))
    #define test   cout<<" We Fucked up Here Boss_________________"<<endl
    #define ezi(lblb) int lblb; cin>>lblb
    #define ezll(lblb) ll lblb; cin>>lblb
    #define pii pair<int,int>pair
    //#define int ll
    #define star *
    ///**************************** C o n s t ****************************///
    const double PI = acos(-1);
    const double eps = 1e-9;
    const int inf = 2000000000; //9 zeros
    const ll infLL = 9000000000000000000;
    const int lazy = int('a' - 'A');
    const ll N = 1e7 + 1;
    string alphabet = "abcdefghijklmnopqrstuvwxyz";
    ll sum = 0, final = 0, result = 0;
    #define lmao(s,arr) for(int i =  0 ; i <s.size();i++){arr[i]=s[i];}
    ///**************************** F U N C T I O N S  ****************************///
    //Comment Code Block Ctrl + K + C / Ctrl + K + U-->remove comment
    bool checkperfectsquare(int n)
{
    if (ceil((double)sqrt(n)) == floor((double)sqrt(n))) {
       return true;
    }
    else {
return false;    }
}
void it_was_me_dio_hahahahahaha()
{
	int n;
	cin >> n;
	vector<int>v;
	bool flag = 0;
	bool flag1 = 0;
	int c = 0;
	while (n--)
	{
		int k;
		cin >> k;
		if (!checkperfectsquare(k))
		{
			c++;
		}
	}
	if (c>=1)
	{
		cout << "YES" << endl;
	}
	else {
		cout << "NO" << endl;
	}
}
    int main()
    {
    	ios_base::sync_with_stdio(0);
    	cin.tie(0);
    	cout.tie(0);
        Speedo;
        int t;
        t = 1;
 
        cin >> t;
        while (t--)
        {
            it_was_me_dio_hahahahahaha();
        }
        return 0;
    }
    // static (data type) by3'aly al data type mostmr
    /**/
    /* stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
        * DON"T GET STUCK ON ONE PROBLEM
    */