Double-base palindromes
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.)
双进制回文数
十进制数585=10010010012(二进制表示),因此它在这两种进制下都是回文数。
找出所有小于一百万,且在十进制和二进制下均回文的数,并求它们的和。
(请注意,无论在哪种进制下,回文数均不考虑前导零。)
这个问题主要就是判断一个数十进制和二进制是否是回文数,十进制很好判断,而二进制如何去判断,如何去把他的二进制倒过来;这里会用到位运算,将二进制的低位换到高位去,高位换到低位来;创建一个变量来存二进制倒过来的数n,而原来的数就为k:
n = n << 1 | (k & 1);
k = k >> 1;直到k等于0结束
然后再去判断n与之前的k是否相等,相等说明构成回文数;
下面就开始实现代码:
#include <stdio.h> #define MAX_N 1000000 int is_ten(int x) {//判断10进制是否为回文数 int k = x; int temp = 0; while (k) { temp = temp * 10 + (k % 10); k /= 10; } return temp == x; } int is_two(int x) {//判断2进制是否为回文数 int k = x; int temp = 0; while (k) { temp = temp << 1 | (k & 1); k = k >> 1; } return temp == x; } int main() { int ans = 0; for (int i = 1; i < MAX_N; i++) { if (!is_ten(i) || !is_two(i)) continue; ans += i; } printf("%d\n", ans); return 0; }
最终答案: 872187