Neliöt

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
ll t[44000];
map<ll, ll> m;
 
void testi(){
    ll n;
    cin >> n;
    bool yes=0;
    for (int i=0; i<=40000 && yes==0; ++i){
        if (m[n-t[i]]) yes=1;
    }
    if (yes==0) cout << "NO\n";
    else cout << "YES\n";
}
 
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //�l� k�yt�, jos teht�v� on interaktiivinen!
    for (int i=0; i<=40000; ++i){
        t[i]=i*i;
        m[i*i]=1;
    }
    int t;
    cin >> t;
    while (t--) testi();
}
 
 
 
 
 

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: TIME LIMIT EXCEEDED