九度链接:http://ac.jobdu.com/problem.php?pid=1208
-
题目描述:
-
对于一个十进制数A,将A转换为二进制数,然后按位逆序排列,再转换为十进制数B,我们乘B为A的二进制逆序数。
例如对于十进制数173,它的二进制形式为10101101,逆序排列得到10110101,其十进制数为181,181即为173的二进制逆序数。
-
输入:
-
一个1000位(即10^999)以内的十进制数。
-
输出:
-
输入的十进制数的二进制逆序数。
-
样例输入:
-
173
-
样例输出:
-
181
-
答疑:
- 解题遇到问题?分享解题心得?讨论本题请访问: http://t.jobdu.com/thread-7931-1-1.html
注意考虑输入为0的情况!
方法类同:http://blog.csdn.net/wzy_1988/article/details/8649287
// 65.cpp : 题目1208:10进制 VS 2进制
//AC
#include "stdafx.h"
#include <stdio.h>
#include <string.h>
#define maxSize 250
struct bigInteger {
int digit[maxSize];
int size;
void init() {
for (int i = 0; i < maxSize; i ++) {
digit[i] = 0;
size = 0;
}
}
bigInteger operator / (int x) const {
bigInteger ret;
ret.init();
int reminder = 0;
for (int i = size - 1; i >= 0; i --) {
ret.digit[i] = (digit[i] + reminder * 10000) / x;
reminder = (digit[i] + reminder * 10000) % x;
}
ret.size = 0;
for (int i = 0; i < maxSize; i ++)
if (ret.digit[i] != 0)
ret.size = i;
ret.size ++;
return ret;
}
//判断大数除以x后是否为0
int test(int x) {
bigInteger ret;
ret.init();
int reminder = 0;
for (int i = size - 1; i >= 0; i --) {
ret.digit[i] = (digit[i] + reminder * 10000) / x;
reminder = (digit[i] + reminder * 10000) % x;
}
ret.size = 0;
for (int i = 0; i < maxSize; i ++)
if (ret.digit[i] != 0)
ret.size = i;
if (ret.size != 0)
ret.size ++;
else if (ret.size == 0 && ret.digit[0] != 0)
ret.size ++;
return ret.size;
}
bigInteger operator * (int x) const {
bigInteger ret;
ret.init();
int carry = 0;
for (int i = 0 ; i < size; i++) {
ret.digit[ret.size ++] = (digit[i] * x + carry) % 10000;
carry = (digit[i] * x + carry) / 10000;
}
if (carry != 0)
ret.digit[ret.size ++] = carry;
return ret;
}
int operator % (int x) const {
bigInteger ret;
ret.init();
int reminder = 0;
for (int i = size - 1; i >= 0; i --) {
ret.digit[i] = (digit[i] + reminder * 10000) / x;
reminder = (digit[i] + reminder * 10000) % x;
}
return reminder;
}
bigInteger operator + (int x) const {
bigInteger ret;
ret.init();
int tmp = x;
int carry = 0;
for (int i = 0; i < size; i ++) {
ret.digit[ret.size ++] = (digit[i] + carry + tmp) % 10000;
carry = (digit[i] + carry + tmp) / 10000;
if (i == 0)
<span style="white-space:pre"> </span>tmp = 0;
}
if (size == 0) {
ret.digit[ret.size ++] = (digit[0] + carry + tmp) % 10000;
carry = (digit[0] + carry + tmp) / 10000;
}
if (carry != 0)
ret.digit[ret.size ++] = carry;
return ret;
}
void output() {//输出
for (int i = size - 1; i >= 0 ; i --) {
if (i != size - 1)
printf("%04d", digit[i]);
else printf("%d", digit[i]);
}
printf("\n");
}
}a;
char data[1000];
int main() {
while (scanf("%s", data) != EOF) {
a.init();
int len = strlen(data);
int tmp = 0;
//将大数每四位为单位存入a.digit[]中,低位存a.digit[0]
for (int i = len - 1, n = 0, weight = 1; i >= 0; i --) {
tmp = (data[i] - '0') * weight + tmp;
weight *= 10;
n ++;
if (n == 4 || i == 0) {
a.digit[a.size ++] = tmp;
tmp = 0;
weight = 1;
n = 0;
}
}
if (a.size == 1 && a.digit[0] == 0) {//如果输入为0,输出0
printf("0\n");
continue;
}
bigInteger x;
x.init();
while (a.test(2) != 0 || a % 2 != 0) {//如果大数除以2不等于0,或者模2不等于0
int tmp = a % 2;
x = x * 2;
x = x + tmp;
a = a / 2;
/*等同于
x = x * 2 + a % 2;
a = a / 2;
*/
}
x.output();
}
return 0;
}