原理:判断某位的字符是否为“1”,若是“1”则带入算式中
#include <iostream>
using namespace std;
int main()
{
char ch[8];
int a = 0;
cout << "请输入八位二进制数:" << endl;
cin >> ch;
int ch_lenth = strlen(ch) - 1;
while (strlen(ch) != 8)
{
cout << "请输入八位二进制数:" << endl,
cin >> ch;
}
for (int i = ch_lenth; i >= 0; i--)
if (ch[i] == '1')
{
a += pow(2, ch_lenth - i);
}
cout << "数值为:" << a;
}