题目要求已经很明确地说了解题步骤,所以只需要按照步骤来即可,难点就在于字符串的乘除,对于这个,我们可以借助STL的vector来解决,首先十进制转换为二进制的过程中,用个位上的数对2取余存入到vector中,由于模2取余的结果是从后往前的,那么从前往后就是逆序,因此vector中存放的就是逆序,之后再根据vector的值依次乘以2即可得到最终的结果:
#include<iostream>
#include<string>
#include<vector>
using namespace std;
string Divide(string str, int x){
int remainder = 0;
int n = str.size();
for(int i = 0;i < n;i++){
int current = remainder * 10 + str[i] - '0';
str[i] = current / x + '0';
remainder = current % x;
}
int pos = 0;
while(str[pos] == '0') pos++;
return str.substr(pos);
}
string Multiply(string str, int x){
int c = 0; //进位
int n = str.size();
for(int i = n - 1;i >= 0;i--){
int current = (str[i] - '0') * x + c;
str[i] = current % 10 + '0';
c = current / 10;
}
if(c > 0) str = "1" + str; //两个个位数相加最多进位1
return str;
}
string Add(string str, int x){
int c = x;
int n = str.size();
for(int i = n - 1;i >= 0;i--){
int current = str[i] - '0' + c;
str[i] = current % 10 + '0';
c = current / 10;
if(c == 0) break;
}
return str;
}
int main(){
string s;
while(cin>>s){
vector<int> v;
while(s.size() != 0){ //先将十进制转换为二进制,将余数依次存入v中即实现了逆序
int last = s[s.size() - 1] - '0';
v.push_back(last % 2);
s = Divide(s, 2);
}
string total = "0";
int n = v.size();
for(int i = 0;i < n;i++){
total = Multiply(total, 2);
total = Add(total, v[i]);
}
cout<<total<<endl;
}
return 0;
}