Palindromic Squares

按照题目模拟即可，算法上采用的是简单的暴力枚举

题目难度等级：★☆☆☆☆

#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<fstream>
#include<algorithm>
#include<map>
#include<stdlib.h>
#include<vector>
#include<stack>
#include<queue>
#include<set>
using namespace std;
#define FOR(i,a,n) for(int i=a;i<n;i++)
#define REP(i,n) FOR(i,0,n)
ifstream fin("palsquare.in");
ofstream fout("palsquare.out");

int b;

void trans(int a,int bb)
{
	int stac[30],stac1[30],top=0,top1=0;
	int chag=bb;
	char ch;
	while(chag)
	{
		int tmp=chag%b;
		stac[top++]=tmp;
		chag/=b;
	}
	bool flag=true;
	for(int i=0;i<top/2;i++)
		if(stac[i]!=stac[top-1-i]) {flag=false;break;}
	if(flag)
	{
		chag=a;
		while(chag)
		{
			int tmp=chag%b;
			stac1[top1++]=tmp;
			chag/=b;
		}
		while(top1) {if(stac1[--top1]<10) ch=stac1[top1]+'0';else ch='A'+(stac1[top1]-10);fout<<ch;}
		fout<<' ';
		while(top) {if(stac[--top]<10) ch=stac[top]+'0';else ch='A'+(stac[top]-10);fout<<ch;}
		fout<<endl;
	}
}

int main()
{
	fin>>b;
	for(int i=1;i<=300;i++)
	{
		int bb=i*i;
		trans(i,bb);
	}
//	system("pause");
	return 0;
}