P8814，0分求调

#include<bits/stdc++.h>
using namespace std;
long long n[10001],d[10001],e[10001],p[10001],q[10001];
int main()
{
    long long k;
    bool isfind;
    cin>>k;
    for(long long i=1;i<=k;i++)
        cin>>n[i]>>d[i]>>e[i];
    for(long long i=1;i<=k;i++)
    {
        isfind=false;
        for(q[i]=0;q[i]<=max(n[i],max(d[i],e[i]));q[i]++)
        {
            for(p[i]=0;p[i]<=q[i];p[i]++)
            {
                if(n[i]==p[i]*q[i] && e[i]*d[i]==(p[i]-1)*(q[i]-1)+1)
                {   
                    isfind=true;
                    break;
                }
            }
        }
        if(isfind=false)
        {
            p[i]=-1;
            q[i]=-1;
        }
    }
    for(long long i=1;i<=k;i++)
    {
        if(p[i]==-1 && q[i]==-1)
            cout<<"NO\n";
        else
            cout<<p[i]<<q[i]<<endl;
    }
    return 0;
}