####Palindromic Squares####
简述:
输出十进制里1到300之中,找出全部符合平方在2到20进制中有某一种进制下是回文串的数,输出十进制的数以及它的回文串形式的平方。
代码:
#include <stdio.h>
#include <string.h>
char b[] = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J'};
char re[20];
int ispal();
void tran(int x, int base);
int main(void)
{
freopen("palsquare.in", "r", stdin);
freopen("palsquare.out", "w", stdout);
int base, i;
scanf("%d", &base);
for(i = 1; i < 301; i++)
{
tran(i * i, base);
if(ispal())
{
tran(i, base);
printf("%s ", re);
tran(i * i, base);
printf("%s\n", re);
}
}
return 0;
}
void tran(int x, int base)
{
int num, cnt = 0;
memset(re, 0, sizeof(re));
while(x > 0)
{
num = x % base;
re[cnt++] = b[num];
x /= base;
}
for(num = 0; num < cnt / 2; num++)
{
char tmp = re[num];
re[num] = re[cnt - 1 - num];
re[cnt - 1 - num] = tmp;
}
return;
}
int ispal()
{
int i, j;
for(j = 0; re[j] != '\0'; j++);
for(i = 0, j--;j - i > 0; i++, j--)
if(re[i] != re[j])return 0;
return 1;
}