Neliöt

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
set<ll> square;
vector<ll> v;
 
void testCase() {           
    ll n;
    cin >> n;
    for (ll x : v) {
        if (square.count(n-x)) {
            cout << "YES\n";
            return;
        }
    }
    cout << "NO\n";
}
 
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    for (int i = 0; i*i <= 1e9; i++) {
        square.insert(i*i);
        v.push_back(i*i);
    }
    
    int t;
    cin >> t;
    for (int i = 0; i < t; i++) {
        testCase();
    }
}
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: ACCEPTED