usaco 1.2 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





题意：
      比较难懂。。。求1~300（十进制下）的平方在2~20的进制下为回文串的数；

水题啊水题。。。

代码：

/*
ID: jings_h1
PROG: palsquare
LANG: C++
*/

#include<iostream>
#include<fstream>
#include<string.h>
using namespace std;
char a[100];
char b[100];
char trans[25]={'0','1','2','3','4','5','6','7','8','9','A','B','C','D','E','F','G','H','I','J','K'};
bool istrue(char a1[],int times1){
     for(int j=0;j<times1;j++){
             if(a1[j]!=a1[times1-1-j])
                    return false;
                    }
     return true;
     }
int main(){
    int n;
    ofstream fout ("palsquare.out");
    ifstream fin ("palsquare.in");
    while(fin>>n){
       for(int i=1;i<=300;i++){
               memset(a,0,sizeof(a));
               memset(b,0,sizeof(b));
               int times=0;
               int times2=0;
               int temp=i;
            //   int flag=0;
               while(temp!=0){
                     a[times++]=trans[temp%n];
                     temp=temp/n;
                     }
               int temp1=i*i;
               while(temp1!=0){
                     b[times2++]=trans[temp1%n];
                     temp1=temp1/n;
                     }
               if(istrue(b,times2)){
                      for(int k=times-1;k>=0;k--)
                         fout<<a[k];
             //  cout<<" ";
                      fout<<" "<<b<<endl;
                      }
                     }
              
               }
       return 0;
       }