USACO Palindromic Squares

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

这道题目和上题一样，转换进制，判断是否为回文，若是，则输出。呵呵，其实只要掌握了这种类型的题目，是很简单的，挺水的，这两道题目。思路和上次的那道一样。

下面是我的代码：

/*
ID:lclqcsj
PROB:palsquare
LANG:C++
*/

#include<iostream>
#include<cstring>
#include<fstream>
using namespace std;

const int MAXN=50+5;
char str1[MAXN];
char str2[MAXN];

int is_spal(int base, int a)
{
    memset(str1, 0,sizeof(str1));
    memset(str2, 0,sizeof(str2));
    int t=a*a,j=0,k=0,r=0;
    while((k=(t/base))!=t)
    {
        r=t%base;
        if(r>=10)
        {
            str1[j++]=(r-10)+'A';
        }
        else
            str1[j++]=r+'0';
        t=k;
    }
    str1[j]='\0';
    char *pstart=str1;
    char *pend=str1+j-1;
    int flag1=0;
    while(pstart<=pend)
    {
        if(*pstart==*pend)
        {
            pstart++;
            pend--;
        }
        else
            break;
    }
    if(pstart>pend)
        flag1=1;
    if(flag1)
    {
        int t=a,j=0,k=0,r=0;
        while((k=(t/base))!=t)
        {
            r=t%base;
            if(r>=10)
            {
                str2[j++]=r-10+'A';
            }
            else
                str2[j++]=r+'0';
            t=k;
        }
        str2[j]='\0';
        char temp;
        pstart=str2;
        pend=str2+j-1;
        while(pstart<pend)
        {
            temp=*pstart;
            *pstart=*pend;
            *pend=temp;
            pstart++;
            pend--;
        }
    }
    if(flag1)
        return 1;
    else
        return 0;
}

int main(void)
{
    ofstream fout ("palsquare.out");
    ifstream fin ("palsquare.in");

    int i;
    int B;
    fin>>B;
    for(i=1; i<=300; i++)
    {
        int ans=0;
        ans=is_spal(B, i);
        if(ans)
            fout<<str2<<" "<<str1<<endl;
    }
    return 0;
}