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
回文数是指从左向右念和从右像做念都一样的数。如12321就是一个典型的回文数。
给定一个进制B(2<=B<=20十进制),输出所有的大于等于1小于等于300且它的平方用B进制表示时是回文数的数。用’A’,’B’……表示10,11等等。
PROGRAM NAME: palsquare
INPUT FORMAT
共一行,一个单独的整数B(B用十进制表示)。
SAMPLE INPUT (file palsquare.in)
10
OUTPUT FORMAT
每行两个数字,第二个数是第一个数的平方,且第二个数是回文数。(注意:这两个数都应该在B那个进制下)
/*
ID: ******
PROG: palsquare
LANG: C++
*/
#include <fstream>
#include <iostream>
#include <cstring>
using namespace std;
int n;
char buf[100];
void change(int m,int r)//进制转换
{
char buff[100];
int p,q,i,j;
if(r<=10)
{
j=0;
while(m!=0)
{
p=m%r;
m=m/r;
buff[j]=p+'0';
j++;
}
}
else if(r>10)
{
j=0;
while(m!=0)
{
p=m%r;
m=m/r;
if(p<10) buff[j]=p+'0';
else buff[j]=p-10+'A';
j++;
}
}
for(i=0;i<j;i++)
{
buf[i]=buff[j-i-1];
}
}
bool ispal(char buf[])//判断是否为回文串
{
string str;
str=buf;
int i,j;
for(i=0, j=str.size()-1;i<=j;++i,--j)
{
if(str[i]!=str[j]) return false;
}
return true;
}
int main()
{
ifstream fin ("palsquare.in");
ofstream fout ("palsquare.out");
fin>>n;
string real1,real2;
for(int i=1;i<=300;i++)
{
memset(buf,'\0',sizeof(buf));//清空字符数组
int flag=true;
change(i,n);//原数进制转换
real1=buf;
change(i*i,n);//平方数进制转换
real2=buf;
if(!ispal(buf))
{
flag=false;
continue;
}
if(flag)
fout<<real1<<" "<<real2<<endl;
}
return 0;
}