Neliöt

#include <bits/stdc++.h>
 
typedef long long ll;
 
#define M 1000000007
 
using namespace std;
 
void test_case() {
	int n;
	cin >> n; 
     
    map<int, int> d;
 
    while (n > 1) {
        for (int i = 2; i <= n; ++i) {
            if (n % i == 0) {
                n /= i;
                d[i]++;
                break;
            }
        }
    }
 
    for (auto it = d.begin(); it != d.end(); it++) {
        if (it->first % 4 == 3) {
            if (it->second & 1) {
                cout << "NO\n";
                return;
            }
        }
    }
    cout << "YES\n";
}
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int t;
	cin >> t;
	for (int i = 0; i < t; ++i) {
		test_case();
		//cout << "\n";
	}
 
	return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: TIME LIMIT EXCEEDED