Palindromic Squares

Problem：

Palindromic Squares
Rob Kolstad

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.

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

 

---

My Answer：

/* ID:iby071 PROG:palsquare LANG:C++ */ # include<iostream> # include<fstream> # include<cmath> using namespace std; static ofstream fout("palsquare.out",ofstream::out); bool isPal(char num[]) { int num1[17]={0}; //17的来源：（MAX=300）^2<2^17-1 bool flag=true; int skip,l=0; for(skip=0 ;skip<17;++skip) //skip掉数字首的0 if(num[skip]!='0') break; for( ;skip<17;++skip) { num1[l]=num[skip];++l;} //用num1重新保存去掉首位0的num（num1是int[]类型，是因为字符串不方便，而A->ASCII（A）后，比较不受影响） for(int j=0;j<l/2;++j) if(num1[j]!=num1[l-1-j]) flag=false; return flag; } void trans(double base,int n,char num[]) { if(n==0) fout<<'0'; int tmp; for(int i=16;i>=0;--i) { tmp=n/static_cast<int>(pow(base,i)); n%=static_cast<int>(pow(base,i)); if(tmp<10) num[16-i]=tmp+'0'; else num[16-i]=tmp-10+'A'; } num[17]='/0'; }- void print(double base,int n) { if(n==0) fout<<'0'; char num[18]; int tmp,skip; for(int i=16;i>=0;--i) { tmp=n/static_cast<int>(pow(base,i)); n%=static_cast<int>(pow(base,i)); if(tmp<10) num[16-i]=tmp+'0'; else num[16-i]=tmp-10+'A'; } num[17]='/0'; for(skip=0 ;skip<17;++skip) if(num[skip]!='0') break; for( ;skip<17;++skip) fout<<num[skip]; } int main() { ifstream fin("palsquare.in"); double base; int n,square; fin>>base; for(n=1;n<=300;++n) { square=static_cast<int>(pow(double(n),2.0)); char num[18]; trans(base,square,num); if(isPal(num)) { print(base,n); fout<<" "; print(base,square); fout<<endl; } } return 0; }