pat乙1091 N-自守数

#include<iostream>
using namespace std;
int main()
{
    int i,j,n,m,sum,k,flag=0;
    cin>>n;
    for(i=0;i<n;i++)
    {
        cin>>k;
        flag=0;
        for(j=1;j<10;j++)
        {
            sum=j*k*k;
            if(0<=k&&k<10&&sum%10==k)
            {
                cout<<j<<" "<<sum<<endl;
                flag=1;
                break;
            }
            else if(10<=k&&k<100&&sum%100==k)
            {
                cout<<j<<" "<<sum<<endl;
                 flag=1;
                break;
            }
            else if(100<=k&&k<1000&&sum%1000==k)
            {
                cout<<j<<" "<<sum<<endl;
                 flag=1;
                break;
            }
        }
        if(flag==0)
        {
            cout<<"No"<<endl;
        }
    }
    return 0;
}