Palindromic Squares

链接

分析：求出b进制以后在判是否为回文

/*    
    ID:wanghan
    PROB:palsquare
    LANG:C++
*/
#include "iostream"
#include "cstdio"
#include "cstring"
#include "string"
using namespace std;
int b;
bool judge(string s,int i,int j){
    while(i<j){
        if(s[i]==s[j]){
            i++,j--;
        }else{
            return false;
        }
    }
    return true;
}
string Rev(int num){
    string t="";
    while(num){
        int z=num%b;
        if(z>=10)
            t+=(z-10)+'A';
        else
            t+=z+'0';
        num/=b;
    }
    int len=t.length();
    int i=0,j=len-1;
    while(i<j){
        swap(t[i],t[j]);
        i++,j--;
    }
    return t;
}
int main()
{
    freopen("palsquare.in", "r", stdin);  
    freopen("palsquare.out", "w", stdout);
    cin>>b;
    //cout<<Rev(1001)<<endl;
    for(int i=1;i<=300;i++){
        int ans=i,cnt=i*i;
        string h1=Rev(ans),h2=Rev(cnt);
        int len2=h2.length()-1;
        if(judge(h2,0,len2)){
            cout<<h1<<" "<<h2<<endl;
        }
    }
    return 0;
}