1091 N-自守数 (15 分)

3
92 5 233

3 25392
1 25
No

 1//1091 N-自守数 (15 分)
 2#include <iostream>
 3using namespace std;
 4int main(){
 5    int N, tmp;
 6    cin>>N;
 7    for(int i = 0; i < N; i++){
 8        cin>>tmp;
 9        int j = 1;
10        int index = 10;
11        while(index <= tmp)
12            index *= 10;
13        bool flag = false;
14        for(; j < 10; j++){
15            int re = j * tmp * tmp;
16            if((re - tmp) % index == 0){
17                cout<<j<<" "<<re<<endl;
18                flag = true;
19                break;
20            }
21        }
22        if(!flag){
23            cout<<"No"<<endl;
24        }
25    }
26    return 0;
27}