PAT乙级1091

在这里插入图片描述

#include <iostream>
#include <string>
#include <vector>
using namespace std;
//判断一个数是否是自守数
void ziShouShu(int a) {
	string s;
	string aa = to_string(a);
	for (int i = 1; i < 10; i++) {
		//将需要检验的数转化为string
		s = to_string(i*a*a);
		string temp = s.substr(s.size() - aa.size() , aa.size());
		if (a == stoi(temp)) {
			cout << i << " " << i * a*a;
			return;
		}
	}
	cout << "No";
}
int main()
{
	int m;
	cin >> m;
	vector<int>num;
	for (int i = 0; i < m; i++) {
		int a;
		cin >> a;
		num.push_back(a);
	}
	for (vector<int>::iterator it = num.begin(); it != num.end(); it++) {
		//控制输出格式
		if (it == num.begin()) {
			ziShouShu(*it);
		}
		else {
			cout << endl;
			ziShouShu(*it);
		}
	}
	return 0;
}

猜你喜欢

转载自blog.csdn.net/qq_42673507/article/details/84978961