Neliöt

#include <iostream>
#include <unordered_set>
using namespace std;

int squares[31623];
unordered_set<int> sqSet;

void test(int num) {
    for (int j = 0; j < 31623; j++) {
        int sq = squares[j];
        if (num < sq) break;
        if (sqSet.count(num - sq) > 0) {
            cout << "YES" << endl;
            return;
        }
    }
    cout << "NO" << endl;
}

int main()
{
    for (int i = 0; i < 31623; i++) {
        squares[i] = i * i;
        sqSet.insert(squares[i]);
    }

    int amo;
    cin >> amo;

    for (int i = 0; i < amo; i++) {
        int num;
        cin >> num;
        test(num);
    }
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: ACCEPTED