int main() {
int number;
scanf("%d", &number);
printf("%d\n", is_binary_palindrome(number));
return 0;
}
int main()
{
unsigned int numbers[] = { 64575, 1398101, 911, 262015 } ;
for( unsigned int i = 0 ; i < sizeof(numbers) / sizeof( numbers[0] ) ; ++i )
{
const unsigned int n = numbers[i] ;
printf( "%u is %sa binary palindrome. (", n, is_binary_palindrome(n) ? "" : "not " ) ;
print_bits(n) ;
puts( ")" ) ;
}
}
int main(int argc, char *argv[]) {
unsigned int sum = 0;
for (unsigned int i = 0; i < 1000000; ++i) {
if (is_binary_palindrome(i) && is_integer_palindrome(i)) {
std::cout << i << " ";
sum += i;
}
}
std::cout << "\nsum: " << sum << std::endl;
return 0;
}
void calculate_solution(void)
{
unsigned N = 1000*1000;
unsigned sum = 0;
for (unsigned i = 1; i < N; ++i) {
if (is_binary_palindrome(i) && is_decimal_palindrome(i)) {
sum += i;
}
}
printf("Solution = %d\n", sum);
}
