Submission #59211299

---

Source Code Expand

#include<bits/stdc++.h>
#include<iostream>
//#include<cstdio>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#define int long long
typedef long long ll;
#define F first
#define S second
#define pb emplace_back
bool dp[31][31][901];
signed main()
{
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    int n;
    cin>>n;
    for(int i=0;i<=n;i++) for(int j=0;j<=n;j++) dp[i][j][0]=1;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            dp[i][j][0]=1;
            for(int k=2;k<=i;k++)
            {
                for(int l=2;l<=j;l++)
                {
                    for(int ii=0;ii<=n*n;ii++)
                    {
                        if(dp[i-k][j-l][ii]) dp[i][j][k*l+ii]=1;
                    }
                }
            }
        }
    }
    //return 0;
    int t;
    cin>>t;
    while(t--)
    {
        int x;
        cin>>x;
        if(dp[n][n][n*n-x]) cout<<"Yes"<<'\n';
        else cout<<"No"<<'\n';
    }






}

Submission Info

Judge Result