RT考试题目，回锅，非高考

#include<bits/stdc++.h>
using namespace std;
struct node
{
	int x,y;
}a[100005];
int n;
bool h(int x)
{
	int w[11]={0},sum=0;
	while(x)
	{
		sum++;
		w[sum]=x%10;
		x/=10;
	}
	for(int i=-1;i<=sum/2;i++)
	{
		if(w[i]!=w[sum-i])
			return false;
	} 
	return true;
}
int main()
{
	cin>>n;
	for(int i=1;i<=300;i++)
	{  
		a[i].x=i;
		a[i].y=i*i;
		if(h(i*i)&&h(i))
			cout<<a[i].x<<" "<<a[i].y<<endl;
	}
	return 0;
}