1.2.4 Palindromic Squares

Palindromes are numbers that read the same forwards as backwards. The number 12321 is a typical palindrome.

Given a number base B (2 <= B <= 20 base 10), print all the integers N (1 <= N <= 300 base 10) such that the square of N is palindromic when expressed in base B; also print the value of that palindromic square. Use the letters 'A', 'B', and so on to represent the digits 10, 11, and so on.

Print both the number and its square in base B.

PROGRAM NAME: palsquare

INPUT FORMAT

A single line with B, the base (specified in base 10).

SAMPLE INPUT (file palsquare.in)

10

OUTPUT FORMAT

Lines with two integers represented in base B. The first integer is the number whose square is palindromic; the second integer is the square itself. NOTE WELL THAT BOTH INTEGERS ARE IN BASE B!

SAMPLE OUTPUT (file palsquare.out)

1 1

2 4

3 9

11 121

22 484

26 676

101 10201

111 12321

121 14641

202 40804

212 44944

264 69696

 

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
    freopen("palsquare.in","r",stdin);
    freopen("palsquare.out","w",stdout);
    char m[111],c[111];
    int n;
    cin>>n;
    long long p;
    for(int i=1;i<=300;i++){
        p=i*i;
        int j=0;
        int b=i;
        int z=0;
        while(b){
            if(b%n<10) c[z++]=b%n+'0';
            else c[z++]=b%n-10+'A';
            b/=n;
        }
        while(p){
            if(p%n<10) m[j++]=p%n+'0';
            else m[j++]=p%n-10+'A';
            p/=n;
        }
        int f=1;
        for(int l=0,k=j-1;l<j;l++,k--){
            if(m[l]!=m[k]){
                f=0;
                break;
            }
        }
        if(f) {
            for(int l=z-1;l>=0;l--) cout<<c[l];
            cout<<" ";
            for(int l=j-1;l>=0;l--) cout<<m[l];
            cout<<endl;
        }
    }
    return 0;
}