PAT 1091 N-自守数 (15 分)

#include <iostream>
using namespace std;

int main() {
    int m;
    cin>>m;
    for(int i=0;i<m;i++){
        int k, flag = 0;
        cin >> k;
        for (int n = 1; n < 10; n++) {
            int mul = n * k * k;
            string smul = to_string(mul), sk = to_string(k);        //把整数转换成字符
            string smulend = smul.substr(smul.length() - sk.length());   //拷贝从下标smul.length() - sk.length()到末尾的字符
            if (smulend == sk) {                  //末尾和K相等
                printf("%d %d\n", n, mul);
                flag = 1;                          //是自守数
                break;
            }
        }
        if (flag == 0) printf("No\n");
    }
    system("pause");
    return 0;
}