#include <algorithm>
#include <iostream>
#include <bitset>
bool isBinaryRepresentationOfNumberPalindrome(unsigned int num) {
std::string binary = std::bitset<16>(num).to_string();
binary.erase(0, binary.find_first_not_of('0'));
std::string reversebinary = binary;
std::reverse(reversebinary.begin(), reversebinary.end());
return binary == reversebinary;
}
bool isPalindrome(int n) {
int reverse = 0, temp = n;
while (temp != 0) {
int remainder = temp % 10;
reverse = (reverse * 10) + remainder;
temp = temp / 10;
}
return n == reverse;
}
int main()
{
unsigned int n = 585; // 1001001001
std::cout << (isPalindrome(n) && isBinaryRepresentationOfNumberPalindrome(n) ? "yes" : "no");
}
/*
run:
yes
*/
