PAT B1091

1091 N- Automorphic number (15 branch )

If a certain number K Times the square of N in the future , The last few digits of the result are equal to K, So call this number “N- Automorphic number ”. for example 3×922=25392, and 25392 The last two of them are just 92, therefore 92 It's a 3- Automorphic number .

This question asks you to write a program to judge whether a given number is about a certain N yes N- Automorphic number .

Input format ：

Enter a positive integer in the first line M（≤20）, The next line shows M One to be tested 、 No more than 1000 The positive integer .

Output format ：

For each number that needs to be tested , If it is N- The automorphic number outputs the smallest in a row N and NK2 Value , Separated by a space ; Otherwise output No. Attention topic guarantee N<10.

sample input ：

3
92 5 233

sample output ：

3 25392
1 25
No

#include <iostream>

using namespace std;

int main()
{
    int m;
    cin >> m;
    int x,squ;
    while(m--)
    {
        cin >> x;
        squ=x*x;
        int i;
        for(i=1000;i>=1;i/=10)
        {
            if(x/i!=0)
            {
                i*=10;
                break;
            }
        }
        for(int n=1;n<10;++n)
        {
            int squ_n;
            squ_n=squ*n;
            if(squ_n%i==x)
            {
                cout << n << ' ' << squ_n << endl;
                break;
            }
            else if(n==9)
                cout << "No\n";
        }


    }
    return 0;
}