Neliöt

#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define F first
#define S second

using namespace std;

void solve(int n) {
	for (int k=2;k*k<=n;k++) {
		if (n%k!=0) continue;
		if (k%4==3) {
			int kk=k*k;
			while (n%kk==0) n/=kk;
			if (n%k==0) {
				cout<<"NO\n";
				return;
			}
		}
		while (n%k==0) n/=k;
	}
	if (n%4==3) cout<<"NO\n";
	else cout<<"YES\n";
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int tst;
	cin>>tst;
	for (int t=0;t<tst;t++) {
		int n;
		cin>>n;
		solve(n);
	}
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: ACCEPTED