C 涂墙

题目链接：2021年广东工业大学第十五届文远知行杯程序设计竞赛（同步赛）C

题目大意

问你能否找到5个数使得这五个数的完全平方和等于n？ 1<=n<=1e6

思路

有返回值的搜索。层数大于5直接返回false，下一个值 t*t找大于n的最小完全平方数。

ac代码

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(time(0));
#define io cin.tie(0);ios::sync_with_stdio(false);
#define ok(x, y) x >= 1 && x <= n && y >= 1 && y <= m
#define debug(x) cout<<#x<<"="<<x<<endl
#define lowbit(x) x&(-x)
#define pii pair<int,int>
#define mk make_pair
#define ll long long
#define ull unsigned long long
#define rs p<<1|1
#define ls p<<1
const int maxn = 1e6 + 5;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 1e18;
const int bas  = 233;
inline ll read(){
    ll p=0,f=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
    while(c>='0'&&c<='9'){p=(p<<1)+(p<<3)+(c^48),c=getchar();}
    return f*p;
}

int n;
bool dfs(int dep, int sum, int now){
    if(dep == 6) return sum ==  n;
    if(sum > n) return false;
    for(int i = now; i >= 1; i --){
        if(dfs(dep + 1, sum + i * i, i)) return true;
    }
    return false;
}
void solve(){
   cin >> n;
   int t = 1;
   while(t * t <= n) t ++;
   if(dfs(1, 0, t)) cout << "YES" << endl;
   else cout << "NO" << endl;
}
int main(){
    // freopen("1.in", "r", stdin);
    // freopen("std.out", "w", stdout);
    // cout << fixed << setprecision(6)
    io;
    int t = 1;
    cin >> t;
    while(t --){
        solve();
    }
    return 0;
}