Neliöt

#include <stdio.h> // include before iostream for faster scanf
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <set>
#include <unordered_set>
#include <cmath>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <sstream>
#include <tuple>
#include <utility>
#include <iomanip>
#include <iterator>

using namespace std;
typedef long long LL;

#define printv(printVec) for (auto printVecIter : (printVec)) cout << printVecIter << " "; cout << endl;

// g++ -Wall -Wshadow -std=c++11 a.cpp && ./a.out


bool perf(int n) {
	double sq = sqrt(n);
	int a = (int) sq;
	int b = a + 1;
	return a*a == n || b*b == n;
}

bool test(int n) {
	for (int i = 1; i*i <= n; i++) {
		if (perf(n - i*i)) {
			return true;
		}
	}
	return false;
}

int main() {
	std::ios::sync_with_stdio(false);cin.tie(0);
	int t; cin>>t;
	while (t--) {
		int n; cin>>n;
		if (test(n)) {
			cout << "YES\n";
		} else {
			cout << "NO\n";
		}
	}
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: ACCEPTED