The decimal number, 585 = 10010010012 (binary), is palindromic in both bases.
Find the sum of all numbers, less than one million, which are palindromic in base 10 and base 2.
(Please note that the palindromic number, in either base, may not include leading zeros.)
#define N 1000000
#define X 7
#define Y 25
bool palindromic(char a[])
{
int l = strlen(a);
for (int i = 0; i < l/2; i++)
{
if (a[i] != a[l-i-1])
{
return false;
}
}
return true;
}
int main()
{
clock_t ts,te;
ts=clock();
int answer = 0;
char de[X],bi[Y];
for (int i = 0; i < N; i++)
{
_itoa(i,de,10);
_itoa(i,bi,2);
if (palindromic(bi) == true && palindromic(de) == true)
{
printf("%d\n",i);
answer += i;
}
}
printf("\nanswer %d",answer);
te=clock();
printf("\ntime difference: %ds\n",(te-ts)/CLOCKS_PER_SEC);
getchar();
return 0;
}